/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 07:41:03,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 07:41:03,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 07:41:03,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 07:41:03,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 07:41:03,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 07:41:03,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 07:41:03,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 07:41:03,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 07:41:03,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 07:41:03,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 07:41:03,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 07:41:03,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 07:41:03,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 07:41:03,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 07:41:03,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 07:41:03,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 07:41:03,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 07:41:03,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 07:41:03,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 07:41:03,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 07:41:03,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 07:41:03,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 07:41:03,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 07:41:03,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 07:41:03,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 07:41:03,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 07:41:03,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 07:41:03,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 07:41:03,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 07:41:03,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 07:41:03,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 07:41:03,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 07:41:03,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 07:41:03,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 07:41:03,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 07:41:03,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 07:41:03,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 07:41:03,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 07:41:03,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 07:41:03,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 07:41:03,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 07:41:03,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 07:41:03,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 07:41:03,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 07:41:03,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 07:41:03,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 07:41:03,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 07:41:03,161 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 07:41:03,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 07:41:03,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 07:41:03,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 07:41:03,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 07:41:03,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 07:41:03,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 07:41:03,162 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 07:41:03,162 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 07:41:03,163 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 07:41:03,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 07:41:03,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 07:41:03,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 07:41:03,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 07:41:03,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 07:41:03,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:41:03,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 07:41:03,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 07:41:03,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 07:41:03,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 07:41:03,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 07:41:03,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 07:41:03,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 07:41:03,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 07:41:03,165 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 07:41:03,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 07:41:03,166 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 07:41:03,166 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 07:41:03,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 07:41:03,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 07:41:03,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 07:41:03,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 07:41:03,409 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 07:41:03,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c [2022-01-11 07:41:03,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b44d2ff3/b3675af28d3f4d94841999b8d0a96f66/FLAG271d4ef73 [2022-01-11 07:41:03,873 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 07:41:03,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c [2022-01-11 07:41:03,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b44d2ff3/b3675af28d3f4d94841999b8d0a96f66/FLAG271d4ef73 [2022-01-11 07:41:03,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b44d2ff3/b3675af28d3f4d94841999b8d0a96f66 [2022-01-11 07:41:03,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 07:41:03,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 07:41:03,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 07:41:03,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 07:41:03,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 07:41:03,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:41:03" (1/1) ... [2022-01-11 07:41:03,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9080b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:03, skipping insertion in model container [2022-01-11 07:41:03,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:41:03" (1/1) ... [2022-01-11 07:41:03,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 07:41:03,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 07:41:04,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c[914,927] [2022-01-11 07:41:04,132 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c[7115,7128] [2022-01-11 07:41:04,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:41:04,223 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 07:41:04,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c[914,927] [2022-01-11 07:41:04,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c[7115,7128] [2022-01-11 07:41:04,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:41:04,308 INFO L208 MainTranslator]: Completed translation [2022-01-11 07:41:04,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04 WrapperNode [2022-01-11 07:41:04,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 07:41:04,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 07:41:04,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 07:41:04,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 07:41:04,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,396 INFO L137 Inliner]: procedures = 74, calls = 87, calls flagged for inlining = 82, calls inlined = 236, statements flattened = 3487 [2022-01-11 07:41:04,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 07:41:04,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 07:41:04,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 07:41:04,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 07:41:04,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 07:41:04,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 07:41:04,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 07:41:04,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 07:41:04,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (1/1) ... [2022-01-11 07:41:04,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:41:04,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:41:04,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 07:41:04,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 07:41:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 07:41:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 07:41:04,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 07:41:04,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 07:41:04,701 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 07:41:04,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 07:41:06,247 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 07:41:06,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 07:41:06,260 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-01-11 07:41:06,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:41:06 BoogieIcfgContainer [2022-01-11 07:41:06,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 07:41:06,263 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 07:41:06,263 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 07:41:06,266 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 07:41:06,268 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:41:06" (1/1) ... [2022-01-11 07:41:06,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:41:06 BasicIcfg [2022-01-11 07:41:06,522 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 07:41:06,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 07:41:06,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 07:41:06,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 07:41:06,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 07:41:03" (1/4) ... [2022-01-11 07:41:06,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1bf1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:41:06, skipping insertion in model container [2022-01-11 07:41:06,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:41:04" (2/4) ... [2022-01-11 07:41:06,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1bf1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:41:06, skipping insertion in model container [2022-01-11 07:41:06,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:41:06" (3/4) ... [2022-01-11 07:41:06,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1bf1ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:41:06, skipping insertion in model container [2022-01-11 07:41:06,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:41:06" (4/4) ... [2022-01-11 07:41:06,527 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-2.cTransformedIcfg [2022-01-11 07:41:06,531 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 07:41:06,531 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 07:41:06,564 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 07:41:06,569 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 07:41:06,569 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 07:41:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 1471 states, 1467 states have (on average 1.5112474437627812) internal successors, (2217), 1470 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:41:06,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:06,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:06,624 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash -924784786, now seen corresponding path program 1 times [2022-01-11 07:41:06,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:06,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867302670] [2022-01-11 07:41:06,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:06,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:06,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:06,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867302670] [2022-01-11 07:41:06,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867302670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:06,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:06,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:06,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122269511] [2022-01-11 07:41:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:06,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:06,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:06,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:06,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:06,880 INFO L87 Difference]: Start difference. First operand has 1471 states, 1467 states have (on average 1.5112474437627812) internal successors, (2217), 1470 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:07,119 INFO L93 Difference]: Finished difference Result 2887 states and 4336 transitions. [2022-01-11 07:41:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:07,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 07:41:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:07,150 INFO L225 Difference]: With dead ends: 2887 [2022-01-11 07:41:07,151 INFO L226 Difference]: Without dead ends: 1555 [2022-01-11 07:41:07,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,163 INFO L933 BasicCegarLoop]: 2169 mSDtfsCounter, 124 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:07,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 4312 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:41:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2022-01-11 07:41:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1551. [2022-01-11 07:41:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1548 states have (on average 1.4799741602067182) internal successors, (2291), 1550 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2291 transitions. [2022-01-11 07:41:07,266 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2291 transitions. Word has length 44 [2022-01-11 07:41:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:07,267 INFO L470 AbstractCegarLoop]: Abstraction has 1551 states and 2291 transitions. [2022-01-11 07:41:07,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2291 transitions. [2022-01-11 07:41:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:41:07,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:07,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:07,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 07:41:07,272 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash -564043536, now seen corresponding path program 1 times [2022-01-11 07:41:07,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:07,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723406664] [2022-01-11 07:41:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:07,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:07,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:07,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723406664] [2022-01-11 07:41:07,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723406664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:07,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:07,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:07,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909268633] [2022-01-11 07:41:07,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:07,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:07,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:07,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,382 INFO L87 Difference]: Start difference. First operand 1551 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:07,435 INFO L93 Difference]: Finished difference Result 1837 states and 2689 transitions. [2022-01-11 07:41:07,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:07,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 07:41:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:07,442 INFO L225 Difference]: With dead ends: 1837 [2022-01-11 07:41:07,442 INFO L226 Difference]: Without dead ends: 1707 [2022-01-11 07:41:07,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,444 INFO L933 BasicCegarLoop]: 2166 mSDtfsCounter, 2129 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:07,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2129 Valid, 2284 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-01-11 07:41:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1703. [2022-01-11 07:41:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1700 states have (on average 1.4688235294117646) internal successors, (2497), 1702 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2497 transitions. [2022-01-11 07:41:07,503 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2497 transitions. Word has length 44 [2022-01-11 07:41:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:07,503 INFO L470 AbstractCegarLoop]: Abstraction has 1703 states and 2497 transitions. [2022-01-11 07:41:07,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2497 transitions. [2022-01-11 07:41:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 07:41:07,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:07,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:07,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 07:41:07,505 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1709464897, now seen corresponding path program 1 times [2022-01-11 07:41:07,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:07,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708575365] [2022-01-11 07:41:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:07,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:07,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:07,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708575365] [2022-01-11 07:41:07,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708575365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:07,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:07,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:07,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399132837] [2022-01-11 07:41:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:07,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:07,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:07,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:07,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,589 INFO L87 Difference]: Start difference. First operand 1703 states and 2497 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:07,642 INFO L93 Difference]: Finished difference Result 2251 states and 3257 transitions. [2022-01-11 07:41:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 07:41:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:07,649 INFO L225 Difference]: With dead ends: 2251 [2022-01-11 07:41:07,649 INFO L226 Difference]: Without dead ends: 1916 [2022-01-11 07:41:07,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,655 INFO L933 BasicCegarLoop]: 2161 mSDtfsCounter, 94 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 4266 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:07,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 4266 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2022-01-11 07:41:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1902. [2022-01-11 07:41:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1899 states have (on average 1.4560294892048447) internal successors, (2765), 1901 states have internal predecessors, (2765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2765 transitions. [2022-01-11 07:41:07,717 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2765 transitions. Word has length 45 [2022-01-11 07:41:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:07,718 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 2765 transitions. [2022-01-11 07:41:07,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2765 transitions. [2022-01-11 07:41:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 07:41:07,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:07,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:07,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 07:41:07,721 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1679882434, now seen corresponding path program 1 times [2022-01-11 07:41:07,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:07,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199458146] [2022-01-11 07:41:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:07,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:07,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:07,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:07,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199458146] [2022-01-11 07:41:07,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199458146] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:07,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:07,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:07,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770066474] [2022-01-11 07:41:07,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:07,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:07,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:07,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,785 INFO L87 Difference]: Start difference. First operand 1902 states and 2765 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:07,869 INFO L93 Difference]: Finished difference Result 2790 states and 3977 transitions. [2022-01-11 07:41:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:07,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 07:41:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:07,877 INFO L225 Difference]: With dead ends: 2790 [2022-01-11 07:41:07,877 INFO L226 Difference]: Without dead ends: 2314 [2022-01-11 07:41:07,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:07,884 INFO L933 BasicCegarLoop]: 2161 mSDtfsCounter, 2117 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2117 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:07,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2117 Valid, 2250 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2022-01-11 07:41:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2282. [2022-01-11 07:41:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2279 states have (on average 1.4326458973233875) internal successors, (3265), 2281 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 3265 transitions. [2022-01-11 07:41:07,947 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 3265 transitions. Word has length 45 [2022-01-11 07:41:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:07,948 INFO L470 AbstractCegarLoop]: Abstraction has 2282 states and 3265 transitions. [2022-01-11 07:41:07,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 3265 transitions. [2022-01-11 07:41:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 07:41:07,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:07,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:07,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 07:41:07,950 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:07,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1105723493, now seen corresponding path program 1 times [2022-01-11 07:41:07,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:07,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996124302] [2022-01-11 07:41:07,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:07,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:08,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:08,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996124302] [2022-01-11 07:41:08,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996124302] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:08,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:08,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:08,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372509691] [2022-01-11 07:41:08,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:08,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:08,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:08,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:08,011 INFO L87 Difference]: Start difference. First operand 2282 states and 3265 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:08,092 INFO L93 Difference]: Finished difference Result 3485 states and 4878 transitions. [2022-01-11 07:41:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:08,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 07:41:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:08,100 INFO L225 Difference]: With dead ends: 3485 [2022-01-11 07:41:08,100 INFO L226 Difference]: Without dead ends: 2601 [2022-01-11 07:41:08,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:08,103 INFO L933 BasicCegarLoop]: 2165 mSDtfsCounter, 2114 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:08,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2114 Valid, 2254 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2022-01-11 07:41:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2579. [2022-01-11 07:41:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 2576 states have (on average 1.4169254658385093) internal successors, (3650), 2578 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3650 transitions. [2022-01-11 07:41:08,181 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3650 transitions. Word has length 51 [2022-01-11 07:41:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:08,184 INFO L470 AbstractCegarLoop]: Abstraction has 2579 states and 3650 transitions. [2022-01-11 07:41:08,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3650 transitions. [2022-01-11 07:41:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:41:08,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:08,190 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:08,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 07:41:08,192 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 47590070, now seen corresponding path program 1 times [2022-01-11 07:41:08,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:08,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170197203] [2022-01-11 07:41:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:08,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:41:08,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:08,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170197203] [2022-01-11 07:41:08,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170197203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:08,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:08,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:41:08,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088453097] [2022-01-11 07:41:08,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:08,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:41:08,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:08,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:41:08,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:08,289 INFO L87 Difference]: Start difference. First operand 2579 states and 3650 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:08,425 INFO L93 Difference]: Finished difference Result 4205 states and 5854 transitions. [2022-01-11 07:41:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:41:08,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 07:41:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:08,435 INFO L225 Difference]: With dead ends: 4205 [2022-01-11 07:41:08,436 INFO L226 Difference]: Without dead ends: 3254 [2022-01-11 07:41:08,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:41:08,439 INFO L933 BasicCegarLoop]: 2154 mSDtfsCounter, 395 mSDsluCounter, 6571 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 8725 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:08,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 8725 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-01-11 07:41:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2603. [2022-01-11 07:41:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 2600 states have (on average 1.406153846153846) internal successors, (3656), 2602 states have internal predecessors, (3656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3656 transitions. [2022-01-11 07:41:08,520 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3656 transitions. Word has length 52 [2022-01-11 07:41:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:08,520 INFO L470 AbstractCegarLoop]: Abstraction has 2603 states and 3656 transitions. [2022-01-11 07:41:08,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3656 transitions. [2022-01-11 07:41:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:41:08,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:08,521 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:08,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 07:41:08,521 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1997890325, now seen corresponding path program 1 times [2022-01-11 07:41:08,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042353023] [2022-01-11 07:41:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:08,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:41:08,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:08,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042353023] [2022-01-11 07:41:08,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042353023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:08,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:08,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:41:08,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186362293] [2022-01-11 07:41:08,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:08,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:41:08,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:41:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:08,562 INFO L87 Difference]: Start difference. First operand 2603 states and 3656 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:08,693 INFO L93 Difference]: Finished difference Result 4358 states and 6005 transitions. [2022-01-11 07:41:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:41:08,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 07:41:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:08,702 INFO L225 Difference]: With dead ends: 4358 [2022-01-11 07:41:08,702 INFO L226 Difference]: Without dead ends: 3193 [2022-01-11 07:41:08,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:41:08,705 INFO L933 BasicCegarLoop]: 2153 mSDtfsCounter, 354 mSDsluCounter, 6588 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 8741 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:08,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 8741 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-01-11 07:41:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2621. [2022-01-11 07:41:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2618 states have (on average 1.3957219251336899) internal successors, (3654), 2620 states have internal predecessors, (3654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 3654 transitions. [2022-01-11 07:41:08,834 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 3654 transitions. Word has length 52 [2022-01-11 07:41:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:08,834 INFO L470 AbstractCegarLoop]: Abstraction has 2621 states and 3654 transitions. [2022-01-11 07:41:08,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 3654 transitions. [2022-01-11 07:41:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:41:08,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:08,835 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:08,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 07:41:08,835 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:08,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2009206452, now seen corresponding path program 1 times [2022-01-11 07:41:08,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:08,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732387602] [2022-01-11 07:41:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:08,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:08,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:08,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732387602] [2022-01-11 07:41:08,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732387602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:08,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:08,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 07:41:08,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270427950] [2022-01-11 07:41:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:08,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 07:41:08,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 07:41:08,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 07:41:08,908 INFO L87 Difference]: Start difference. First operand 2621 states and 3654 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:09,045 INFO L93 Difference]: Finished difference Result 2853 states and 3954 transitions. [2022-01-11 07:41:09,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 07:41:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 07:41:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:09,055 INFO L225 Difference]: With dead ends: 2853 [2022-01-11 07:41:09,055 INFO L226 Difference]: Without dead ends: 2851 [2022-01-11 07:41:09,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:09,057 INFO L933 BasicCegarLoop]: 2162 mSDtfsCounter, 4367 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4367 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:09,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4367 Valid, 2250 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2022-01-11 07:41:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2619. [2022-01-11 07:41:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 2617 states have (on average 1.392816201757738) internal successors, (3645), 2618 states have internal predecessors, (3645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 3645 transitions. [2022-01-11 07:41:09,296 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 3645 transitions. Word has length 52 [2022-01-11 07:41:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:09,297 INFO L470 AbstractCegarLoop]: Abstraction has 2619 states and 3645 transitions. [2022-01-11 07:41:09,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 3645 transitions. [2022-01-11 07:41:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 07:41:09,297 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:09,298 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:09,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 07:41:09,298 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2139104776, now seen corresponding path program 1 times [2022-01-11 07:41:09,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:09,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550011572] [2022-01-11 07:41:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:09,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:09,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:09,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550011572] [2022-01-11 07:41:09,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550011572] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 07:41:09,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56275518] [2022-01-11 07:41:09,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:09,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 07:41:09,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:41:09,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 07:41:09,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 07:41:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:09,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 07:41:09,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 07:41:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:09,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 07:41:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:10,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56275518] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 07:41:10,206 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 07:41:10,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 07:41:10,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599499554] [2022-01-11 07:41:10,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 07:41:10,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 07:41:10,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 07:41:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 07:41:10,207 INFO L87 Difference]: Start difference. First operand 2619 states and 3645 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:10,609 INFO L93 Difference]: Finished difference Result 4976 states and 6745 transitions. [2022-01-11 07:41:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 07:41:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-01-11 07:41:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:10,623 INFO L225 Difference]: With dead ends: 4976 [2022-01-11 07:41:10,623 INFO L226 Difference]: Without dead ends: 4974 [2022-01-11 07:41:10,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 07:41:10,627 INFO L933 BasicCegarLoop]: 2313 mSDtfsCounter, 4880 mSDsluCounter, 7129 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4880 SdHoareTripleChecker+Valid, 9442 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:10,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4880 Valid, 9442 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:10,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2022-01-11 07:41:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 3594. [2022-01-11 07:41:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 3592 states have (on average 1.371380846325167) internal successors, (4926), 3593 states have internal predecessors, (4926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 4926 transitions. [2022-01-11 07:41:10,858 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 4926 transitions. Word has length 53 [2022-01-11 07:41:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:10,859 INFO L470 AbstractCegarLoop]: Abstraction has 3594 states and 4926 transitions. [2022-01-11 07:41:10,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 4926 transitions. [2022-01-11 07:41:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 07:41:10,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:10,860 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:10,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 07:41:11,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 07:41:11,078 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:11,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1623679068, now seen corresponding path program 2 times [2022-01-11 07:41:11,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:11,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239620789] [2022-01-11 07:41:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:11,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:11,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:11,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239620789] [2022-01-11 07:41:11,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239620789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:11,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:11,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:11,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018195221] [2022-01-11 07:41:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:11,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:11,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:11,115 INFO L87 Difference]: Start difference. First operand 3594 states and 4926 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:11,269 INFO L93 Difference]: Finished difference Result 4688 states and 6371 transitions. [2022-01-11 07:41:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:11,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 07:41:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:11,288 INFO L225 Difference]: With dead ends: 4688 [2022-01-11 07:41:11,289 INFO L226 Difference]: Without dead ends: 2948 [2022-01-11 07:41:11,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:11,292 INFO L933 BasicCegarLoop]: 2225 mSDtfsCounter, 2108 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 2341 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:11,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2108 Valid, 2341 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2022-01-11 07:41:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2932. [2022-01-11 07:41:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2930 states have (on average 1.3726962457337883) internal successors, (4022), 2931 states have internal predecessors, (4022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 4022 transitions. [2022-01-11 07:41:11,450 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 4022 transitions. Word has length 56 [2022-01-11 07:41:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:11,450 INFO L470 AbstractCegarLoop]: Abstraction has 2932 states and 4022 transitions. [2022-01-11 07:41:11,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 4022 transitions. [2022-01-11 07:41:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 07:41:11,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:11,451 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:11,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 07:41:11,452 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 486088960, now seen corresponding path program 1 times [2022-01-11 07:41:11,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:11,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341852722] [2022-01-11 07:41:11,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:11,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:11,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:11,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341852722] [2022-01-11 07:41:11,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341852722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:11,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:11,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:11,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120551601] [2022-01-11 07:41:11,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:11,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:11,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:11,481 INFO L87 Difference]: Start difference. First operand 2932 states and 4022 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:11,660 INFO L93 Difference]: Finished difference Result 5419 states and 7170 transitions. [2022-01-11 07:41:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:11,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-11 07:41:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:11,666 INFO L225 Difference]: With dead ends: 5419 [2022-01-11 07:41:11,667 INFO L226 Difference]: Without dead ends: 3317 [2022-01-11 07:41:11,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:11,670 INFO L933 BasicCegarLoop]: 2248 mSDtfsCounter, 89 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 4392 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:11,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 4392 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-11 07:41:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-11 07:41:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3315 states have (on average 1.3517345399698342) internal successors, (4481), 3316 states have internal predecessors, (4481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4481 transitions. [2022-01-11 07:41:11,833 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4481 transitions. Word has length 60 [2022-01-11 07:41:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:11,833 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4481 transitions. [2022-01-11 07:41:11,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4481 transitions. [2022-01-11 07:41:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 07:41:11,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:11,835 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:11,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 07:41:11,835 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1076182875, now seen corresponding path program 1 times [2022-01-11 07:41:11,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:11,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636105737] [2022-01-11 07:41:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:11,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:41:11,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:11,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636105737] [2022-01-11 07:41:11,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636105737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:11,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:11,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:11,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485147866] [2022-01-11 07:41:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:11,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:11,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:11,872 INFO L87 Difference]: Start difference. First operand 3317 states and 4481 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:12,038 INFO L93 Difference]: Finished difference Result 5180 states and 6833 transitions. [2022-01-11 07:41:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 07:41:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:12,043 INFO L225 Difference]: With dead ends: 5180 [2022-01-11 07:41:12,043 INFO L226 Difference]: Without dead ends: 3317 [2022-01-11 07:41:12,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:12,046 INFO L933 BasicCegarLoop]: 2157 mSDtfsCounter, 2100 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:12,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2100 Valid, 2241 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-01-11 07:41:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3317. [2022-01-11 07:41:12,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3317 states, 3315 states have (on average 1.3396681749622925) internal successors, (4441), 3316 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4441 transitions. [2022-01-11 07:41:12,239 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4441 transitions. Word has length 68 [2022-01-11 07:41:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:12,239 INFO L470 AbstractCegarLoop]: Abstraction has 3317 states and 4441 transitions. [2022-01-11 07:41:12,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4441 transitions. [2022-01-11 07:41:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 07:41:12,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:12,241 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:12,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 07:41:12,241 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 106632729, now seen corresponding path program 1 times [2022-01-11 07:41:12,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:12,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542919531] [2022-01-11 07:41:12,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:12,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:41:12,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:12,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542919531] [2022-01-11 07:41:12,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542919531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:12,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:12,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:12,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145345646] [2022-01-11 07:41:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:12,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:12,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:12,275 INFO L87 Difference]: Start difference. First operand 3317 states and 4441 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:12,419 INFO L93 Difference]: Finished difference Result 4616 states and 6075 transitions. [2022-01-11 07:41:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 07:41:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:12,424 INFO L225 Difference]: With dead ends: 4616 [2022-01-11 07:41:12,424 INFO L226 Difference]: Without dead ends: 2991 [2022-01-11 07:41:12,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:12,427 INFO L933 BasicCegarLoop]: 2240 mSDtfsCounter, 99 mSDsluCounter, 2139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:12,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 4379 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2022-01-11 07:41:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2989. [2022-01-11 07:41:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2987 states have (on average 1.3414797455641112) internal successors, (4007), 2988 states have internal predecessors, (4007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4007 transitions. [2022-01-11 07:41:12,591 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4007 transitions. Word has length 69 [2022-01-11 07:41:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:12,591 INFO L470 AbstractCegarLoop]: Abstraction has 2989 states and 4007 transitions. [2022-01-11 07:41:12,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4007 transitions. [2022-01-11 07:41:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 07:41:12,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:12,593 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:12,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 07:41:12,594 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:12,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1477820497, now seen corresponding path program 1 times [2022-01-11 07:41:12,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:12,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366185700] [2022-01-11 07:41:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:12,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 07:41:12,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:12,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366185700] [2022-01-11 07:41:12,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366185700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:12,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:12,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:12,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987151963] [2022-01-11 07:41:12,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:12,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:12,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:12,642 INFO L87 Difference]: Start difference. First operand 2989 states and 4007 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:12,803 INFO L93 Difference]: Finished difference Result 4633 states and 6111 transitions. [2022-01-11 07:41:12,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:12,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-11 07:41:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:12,809 INFO L225 Difference]: With dead ends: 4633 [2022-01-11 07:41:12,809 INFO L226 Difference]: Without dead ends: 3265 [2022-01-11 07:41:12,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:12,812 INFO L933 BasicCegarLoop]: 2151 mSDtfsCounter, 2131 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2131 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:12,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2131 Valid, 2239 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2022-01-11 07:41:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3226. [2022-01-11 07:41:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3224 states have (on average 1.3477047146401986) internal successors, (4345), 3225 states have internal predecessors, (4345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4345 transitions. [2022-01-11 07:41:12,953 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4345 transitions. Word has length 100 [2022-01-11 07:41:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:12,954 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4345 transitions. [2022-01-11 07:41:12,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4345 transitions. [2022-01-11 07:41:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 07:41:12,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:12,955 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:12,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 07:41:12,955 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1828739803, now seen corresponding path program 1 times [2022-01-11 07:41:12,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:12,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793230772] [2022-01-11 07:41:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:12,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:41:12,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793230772] [2022-01-11 07:41:12,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793230772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:12,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:12,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:12,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452396792] [2022-01-11 07:41:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:12,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:12,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:12,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:12,995 INFO L87 Difference]: Start difference. First operand 3226 states and 4345 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:13,148 INFO L93 Difference]: Finished difference Result 4835 states and 6390 transitions. [2022-01-11 07:41:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:13,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 07:41:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:13,153 INFO L225 Difference]: With dead ends: 4835 [2022-01-11 07:41:13,153 INFO L226 Difference]: Without dead ends: 3234 [2022-01-11 07:41:13,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:13,156 INFO L933 BasicCegarLoop]: 2139 mSDtfsCounter, 69 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 4168 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:13,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 4168 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2022-01-11 07:41:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 3234. [2022-01-11 07:41:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3232 states have (on average 1.338799504950495) internal successors, (4327), 3233 states have internal predecessors, (4327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4327 transitions. [2022-01-11 07:41:13,295 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4327 transitions. Word has length 110 [2022-01-11 07:41:13,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:13,296 INFO L470 AbstractCegarLoop]: Abstraction has 3234 states and 4327 transitions. [2022-01-11 07:41:13,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:13,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4327 transitions. [2022-01-11 07:41:13,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 07:41:13,297 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:13,297 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:13,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 07:41:13,298 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:13,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2069279932, now seen corresponding path program 1 times [2022-01-11 07:41:13,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:13,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599361772] [2022-01-11 07:41:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:13,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:41:13,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:13,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599361772] [2022-01-11 07:41:13,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599361772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:13,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:13,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:13,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401930767] [2022-01-11 07:41:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:13,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:13,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:13,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:13,347 INFO L87 Difference]: Start difference. First operand 3234 states and 4327 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:13,550 INFO L93 Difference]: Finished difference Result 4876 states and 6386 transitions. [2022-01-11 07:41:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:13,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 07:41:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:13,558 INFO L225 Difference]: With dead ends: 4876 [2022-01-11 07:41:13,558 INFO L226 Difference]: Without dead ends: 3267 [2022-01-11 07:41:13,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:13,561 INFO L933 BasicCegarLoop]: 2147 mSDtfsCounter, 2026 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2026 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:13,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2026 Valid, 2255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2022-01-11 07:41:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 3267. [2022-01-11 07:41:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3267 states, 3265 states have (on average 1.335375191424196) internal successors, (4360), 3266 states have internal predecessors, (4360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 4360 transitions. [2022-01-11 07:41:13,720 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 4360 transitions. Word has length 110 [2022-01-11 07:41:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:13,721 INFO L470 AbstractCegarLoop]: Abstraction has 3267 states and 4360 transitions. [2022-01-11 07:41:13,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4360 transitions. [2022-01-11 07:41:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 07:41:13,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:13,722 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:13,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 07:41:13,723 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:13,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2061520573, now seen corresponding path program 1 times [2022-01-11 07:41:13,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:13,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104762055] [2022-01-11 07:41:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:13,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:41:13,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:13,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104762055] [2022-01-11 07:41:13,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104762055] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:13,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:13,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:13,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040167534] [2022-01-11 07:41:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:13,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:13,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:13,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:13,774 INFO L87 Difference]: Start difference. First operand 3267 states and 4360 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:13,926 INFO L93 Difference]: Finished difference Result 4036 states and 5324 transitions. [2022-01-11 07:41:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:13,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 07:41:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:13,930 INFO L225 Difference]: With dead ends: 4036 [2022-01-11 07:41:13,930 INFO L226 Difference]: Without dead ends: 2397 [2022-01-11 07:41:13,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:13,932 INFO L933 BasicCegarLoop]: 2142 mSDtfsCounter, 2104 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2104 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:13,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2104 Valid, 2163 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2022-01-11 07:41:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2397. [2022-01-11 07:41:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 2395 states have (on average 1.3582463465553236) internal successors, (3253), 2396 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3253 transitions. [2022-01-11 07:41:14,108 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3253 transitions. Word has length 110 [2022-01-11 07:41:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:14,108 INFO L470 AbstractCegarLoop]: Abstraction has 2397 states and 3253 transitions. [2022-01-11 07:41:14,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3253 transitions. [2022-01-11 07:41:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 07:41:14,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:14,110 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:14,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 07:41:14,110 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -364920864, now seen corresponding path program 1 times [2022-01-11 07:41:14,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:14,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722611503] [2022-01-11 07:41:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:14,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 07:41:14,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:14,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722611503] [2022-01-11 07:41:14,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722611503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:14,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:14,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:14,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736312046] [2022-01-11 07:41:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:14,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:14,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,160 INFO L87 Difference]: Start difference. First operand 2397 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:14,358 INFO L93 Difference]: Finished difference Result 3462 states and 4561 transitions. [2022-01-11 07:41:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-11 07:41:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:14,363 INFO L225 Difference]: With dead ends: 3462 [2022-01-11 07:41:14,363 INFO L226 Difference]: Without dead ends: 2693 [2022-01-11 07:41:14,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,365 INFO L933 BasicCegarLoop]: 2140 mSDtfsCounter, 2091 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:14,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2091 Valid, 2161 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2022-01-11 07:41:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2693. [2022-01-11 07:41:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2691 states have (on average 1.3355629877369009) internal successors, (3594), 2692 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 3594 transitions. [2022-01-11 07:41:14,495 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 3594 transitions. Word has length 113 [2022-01-11 07:41:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:14,495 INFO L470 AbstractCegarLoop]: Abstraction has 2693 states and 3594 transitions. [2022-01-11 07:41:14,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 3594 transitions. [2022-01-11 07:41:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 07:41:14,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:14,497 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:14,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 07:41:14,497 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:14,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 83775775, now seen corresponding path program 1 times [2022-01-11 07:41:14,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:14,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056190810] [2022-01-11 07:41:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:14,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 07:41:14,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:14,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056190810] [2022-01-11 07:41:14,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056190810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:14,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:14,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:14,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330446337] [2022-01-11 07:41:14,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:14,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:14,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:14,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,535 INFO L87 Difference]: Start difference. First operand 2693 states and 3594 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:14,628 INFO L93 Difference]: Finished difference Result 3088 states and 4049 transitions. [2022-01-11 07:41:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:14,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-11 07:41:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:14,631 INFO L225 Difference]: With dead ends: 3088 [2022-01-11 07:41:14,631 INFO L226 Difference]: Without dead ends: 1364 [2022-01-11 07:41:14,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,633 INFO L933 BasicCegarLoop]: 2139 mSDtfsCounter, 58 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4170 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:14,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 4170 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-01-11 07:41:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2022-01-11 07:41:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1363 states have (on average 1.4871606749816582) internal successors, (2027), 1363 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2027 transitions. [2022-01-11 07:41:14,669 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2027 transitions. Word has length 113 [2022-01-11 07:41:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:14,670 INFO L470 AbstractCegarLoop]: Abstraction has 1364 states and 2027 transitions. [2022-01-11 07:41:14,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2027 transitions. [2022-01-11 07:41:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:14,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:14,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:14,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 07:41:14,671 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:14,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -494919767, now seen corresponding path program 1 times [2022-01-11 07:41:14,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:14,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936825533] [2022-01-11 07:41:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:14,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:14,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:14,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936825533] [2022-01-11 07:41:14,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936825533] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:14,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:14,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:14,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147438378] [2022-01-11 07:41:14,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:14,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:14,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:14,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:14,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,720 INFO L87 Difference]: Start difference. First operand 1364 states and 2027 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:14,812 INFO L93 Difference]: Finished difference Result 3855 states and 5710 transitions. [2022-01-11 07:41:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:14,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:14,816 INFO L225 Difference]: With dead ends: 3855 [2022-01-11 07:41:14,816 INFO L226 Difference]: Without dead ends: 2509 [2022-01-11 07:41:14,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,819 INFO L933 BasicCegarLoop]: 2021 mSDtfsCounter, 1892 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1892 SdHoareTripleChecker+Valid, 3813 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:14,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1892 Valid, 3813 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-01-11 07:41:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2022-01-11 07:41:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4796488427773344) internal successors, (3708), 2506 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3708 transitions. [2022-01-11 07:41:14,894 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3708 transitions. Word has length 143 [2022-01-11 07:41:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:14,894 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3708 transitions. [2022-01-11 07:41:14,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3708 transitions. [2022-01-11 07:41:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:14,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:14,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:14,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 07:41:14,895 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -379983159, now seen corresponding path program 1 times [2022-01-11 07:41:14,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:14,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79551268] [2022-01-11 07:41:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:14,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:14,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79551268] [2022-01-11 07:41:14,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79551268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:14,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:14,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:14,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823751872] [2022-01-11 07:41:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:14,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:14,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:14,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:14,935 INFO L87 Difference]: Start difference. First operand 2507 states and 3708 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:15,021 INFO L93 Difference]: Finished difference Result 4995 states and 7385 transitions. [2022-01-11 07:41:15,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:15,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:15,026 INFO L225 Difference]: With dead ends: 4995 [2022-01-11 07:41:15,026 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:15,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,030 INFO L933 BasicCegarLoop]: 2015 mSDtfsCounter, 2002 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:15,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2002 Valid, 2015 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4764565043894653) internal successors, (3700), 2506 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3700 transitions. [2022-01-11 07:41:15,109 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3700 transitions. Word has length 143 [2022-01-11 07:41:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:15,109 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3700 transitions. [2022-01-11 07:41:15,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3700 transitions. [2022-01-11 07:41:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:15,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:15,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:15,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 07:41:15,110 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:15,111 INFO L85 PathProgramCache]: Analyzing trace with hash -930464855, now seen corresponding path program 1 times [2022-01-11 07:41:15,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:15,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892735559] [2022-01-11 07:41:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:15,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:15,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:15,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892735559] [2022-01-11 07:41:15,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892735559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:15,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:15,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:15,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974281733] [2022-01-11 07:41:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:15,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:15,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:15,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:15,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,146 INFO L87 Difference]: Start difference. First operand 2507 states and 3700 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:15,236 INFO L93 Difference]: Finished difference Result 4994 states and 7368 transitions. [2022-01-11 07:41:15,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:15,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:15,241 INFO L225 Difference]: With dead ends: 4994 [2022-01-11 07:41:15,241 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:15,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,245 INFO L933 BasicCegarLoop]: 2010 mSDtfsCounter, 1996 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:15,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1996 Valid, 2010 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4732641660015962) internal successors, (3692), 2506 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3692 transitions. [2022-01-11 07:41:15,344 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3692 transitions. Word has length 143 [2022-01-11 07:41:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:15,344 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3692 transitions. [2022-01-11 07:41:15,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3692 transitions. [2022-01-11 07:41:15,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:15,345 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:15,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:15,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 07:41:15,346 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1268534985, now seen corresponding path program 1 times [2022-01-11 07:41:15,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:15,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045153825] [2022-01-11 07:41:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:15,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:15,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-11 07:41:15,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:15,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045153825] [2022-01-11 07:41:15,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045153825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:15,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:15,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:15,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663182664] [2022-01-11 07:41:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:15,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:15,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,394 INFO L87 Difference]: Start difference. First operand 2507 states and 3692 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:15,507 INFO L93 Difference]: Finished difference Result 4993 states and 7351 transitions. [2022-01-11 07:41:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:15,511 INFO L225 Difference]: With dead ends: 4993 [2022-01-11 07:41:15,511 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:15,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,514 INFO L933 BasicCegarLoop]: 2005 mSDtfsCounter, 1990 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:15,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1990 Valid, 2005 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.470071827613727) internal successors, (3684), 2506 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3684 transitions. [2022-01-11 07:41:15,591 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3684 transitions. Word has length 143 [2022-01-11 07:41:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:15,591 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3684 transitions. [2022-01-11 07:41:15,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3684 transitions. [2022-01-11 07:41:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:15,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:15,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:15,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 07:41:15,592 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1570023511, now seen corresponding path program 1 times [2022-01-11 07:41:15,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:15,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342237166] [2022-01-11 07:41:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:15,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:15,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:15,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342237166] [2022-01-11 07:41:15,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342237166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:15,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:15,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:15,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666292514] [2022-01-11 07:41:15,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:15,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:15,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,620 INFO L87 Difference]: Start difference. First operand 2507 states and 3684 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:15,707 INFO L93 Difference]: Finished difference Result 4992 states and 7334 transitions. [2022-01-11 07:41:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:15,711 INFO L225 Difference]: With dead ends: 4992 [2022-01-11 07:41:15,711 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:15,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,715 INFO L933 BasicCegarLoop]: 2000 mSDtfsCounter, 1984 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:15,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1984 Valid, 2000 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4668794892258579) internal successors, (3676), 2506 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3676 transitions. [2022-01-11 07:41:15,796 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3676 transitions. Word has length 143 [2022-01-11 07:41:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:15,797 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3676 transitions. [2022-01-11 07:41:15,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3676 transitions. [2022-01-11 07:41:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:15,797 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:15,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:15,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 07:41:15,798 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:15,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1663546057, now seen corresponding path program 1 times [2022-01-11 07:41:15,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:15,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455669205] [2022-01-11 07:41:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:15,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:15,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:15,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455669205] [2022-01-11 07:41:15,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455669205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:15,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:15,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:15,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079281527] [2022-01-11 07:41:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:15,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:15,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:15,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,826 INFO L87 Difference]: Start difference. First operand 2507 states and 3676 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:15,913 INFO L93 Difference]: Finished difference Result 4991 states and 7317 transitions. [2022-01-11 07:41:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:15,917 INFO L225 Difference]: With dead ends: 4991 [2022-01-11 07:41:15,917 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:15,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:15,920 INFO L933 BasicCegarLoop]: 1995 mSDtfsCounter, 1978 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:15,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1978 Valid, 1995 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4636871508379887) internal successors, (3668), 2506 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3668 transitions. [2022-01-11 07:41:16,022 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3668 transitions. Word has length 143 [2022-01-11 07:41:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:16,022 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3668 transitions. [2022-01-11 07:41:16,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3668 transitions. [2022-01-11 07:41:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:16,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:16,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:16,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 07:41:16,024 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:16,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2044949417, now seen corresponding path program 1 times [2022-01-11 07:41:16,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:16,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212250900] [2022-01-11 07:41:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:16,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:16,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:16,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212250900] [2022-01-11 07:41:16,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212250900] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:16,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:16,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:16,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810814364] [2022-01-11 07:41:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:16,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:16,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:16,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:16,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,053 INFO L87 Difference]: Start difference. First operand 2507 states and 3668 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:16,149 INFO L93 Difference]: Finished difference Result 4990 states and 7300 transitions. [2022-01-11 07:41:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:16,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:16,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:16,153 INFO L225 Difference]: With dead ends: 4990 [2022-01-11 07:41:16,153 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:16,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,156 INFO L933 BasicCegarLoop]: 1990 mSDtfsCounter, 1972 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:16,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1972 Valid, 1990 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4604948124501198) internal successors, (3660), 2506 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3660 transitions. [2022-01-11 07:41:16,250 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3660 transitions. Word has length 143 [2022-01-11 07:41:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:16,251 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3660 transitions. [2022-01-11 07:41:16,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3660 transitions. [2022-01-11 07:41:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:16,251 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:16,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:16,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 07:41:16,252 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -298051895, now seen corresponding path program 1 times [2022-01-11 07:41:16,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004273422] [2022-01-11 07:41:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:16,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:16,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:16,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004273422] [2022-01-11 07:41:16,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004273422] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:16,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:16,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:16,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092968655] [2022-01-11 07:41:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:16,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:16,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:16,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:16,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,281 INFO L87 Difference]: Start difference. First operand 2507 states and 3660 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:16,379 INFO L93 Difference]: Finished difference Result 4989 states and 7283 transitions. [2022-01-11 07:41:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:16,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:16,384 INFO L225 Difference]: With dead ends: 4989 [2022-01-11 07:41:16,384 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:16,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,389 INFO L933 BasicCegarLoop]: 1985 mSDtfsCounter, 1966 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:16,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1966 Valid, 1985 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4573024740622507) internal successors, (3652), 2506 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3652 transitions. [2022-01-11 07:41:16,489 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3652 transitions. Word has length 143 [2022-01-11 07:41:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:16,489 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3652 transitions. [2022-01-11 07:41:16,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3652 transitions. [2022-01-11 07:41:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:16,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:16,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:16,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 07:41:16,490 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash -927821911, now seen corresponding path program 1 times [2022-01-11 07:41:16,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:16,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604323776] [2022-01-11 07:41:16,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:16,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:16,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:16,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604323776] [2022-01-11 07:41:16,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604323776] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:16,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:16,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:16,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941107445] [2022-01-11 07:41:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:16,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:16,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:16,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,552 INFO L87 Difference]: Start difference. First operand 2507 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:16,691 INFO L93 Difference]: Finished difference Result 4987 states and 7264 transitions. [2022-01-11 07:41:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:16,696 INFO L225 Difference]: With dead ends: 4987 [2022-01-11 07:41:16,696 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:16,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,700 INFO L933 BasicCegarLoop]: 1980 mSDtfsCounter, 1959 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1959 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:16,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1959 Valid, 1980 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4541101356743815) internal successors, (3644), 2506 states have internal predecessors, (3644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3644 transitions. [2022-01-11 07:41:16,800 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3644 transitions. Word has length 143 [2022-01-11 07:41:16,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:16,800 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3644 transitions. [2022-01-11 07:41:16,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3644 transitions. [2022-01-11 07:41:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:16,801 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:16,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:16,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 07:41:16,802 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:16,802 INFO L85 PathProgramCache]: Analyzing trace with hash 103923849, now seen corresponding path program 1 times [2022-01-11 07:41:16,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:16,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705809335] [2022-01-11 07:41:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:16,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:16,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:16,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705809335] [2022-01-11 07:41:16,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705809335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:16,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:16,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:16,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254286028] [2022-01-11 07:41:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:16,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:16,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:16,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,847 INFO L87 Difference]: Start difference. First operand 2507 states and 3644 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:16,959 INFO L93 Difference]: Finished difference Result 4986 states and 7247 transitions. [2022-01-11 07:41:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:16,962 INFO L225 Difference]: With dead ends: 4986 [2022-01-11 07:41:16,962 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:16,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:16,966 INFO L933 BasicCegarLoop]: 1975 mSDtfsCounter, 1953 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:16,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1953 Valid, 1975 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4509177972865124) internal successors, (3636), 2506 states have internal predecessors, (3636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3636 transitions. [2022-01-11 07:41:17,064 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3636 transitions. Word has length 143 [2022-01-11 07:41:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:17,064 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3636 transitions. [2022-01-11 07:41:17,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3636 transitions. [2022-01-11 07:41:17,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:17,065 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:17,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:17,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 07:41:17,066 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:17,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1248267351, now seen corresponding path program 1 times [2022-01-11 07:41:17,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:17,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414946518] [2022-01-11 07:41:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:17,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:17,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:17,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414946518] [2022-01-11 07:41:17,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414946518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:17,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:17,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:17,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852979378] [2022-01-11 07:41:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:17,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:17,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:17,096 INFO L87 Difference]: Start difference. First operand 2507 states and 3636 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:17,266 INFO L93 Difference]: Finished difference Result 4985 states and 7230 transitions. [2022-01-11 07:41:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:17,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:17,269 INFO L225 Difference]: With dead ends: 4985 [2022-01-11 07:41:17,269 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:17,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:17,273 INFO L933 BasicCegarLoop]: 1944 mSDtfsCounter, 1822 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:17,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1822 Valid, 2052 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:17,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4381484437350358) internal successors, (3604), 2506 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3604 transitions. [2022-01-11 07:41:17,409 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3604 transitions. Word has length 143 [2022-01-11 07:41:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:17,409 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3604 transitions. [2022-01-11 07:41:17,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3604 transitions. [2022-01-11 07:41:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:17,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:17,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:17,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 07:41:17,411 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1158780168, now seen corresponding path program 1 times [2022-01-11 07:41:17,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:17,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547403857] [2022-01-11 07:41:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:17,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:17,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:17,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547403857] [2022-01-11 07:41:17,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547403857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:17,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:17,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:17,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587979112] [2022-01-11 07:41:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:17,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:17,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:17,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:17,446 INFO L87 Difference]: Start difference. First operand 2507 states and 3604 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:17,571 INFO L93 Difference]: Finished difference Result 4984 states and 7165 transitions. [2022-01-11 07:41:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:17,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:17,574 INFO L225 Difference]: With dead ends: 4984 [2022-01-11 07:41:17,574 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:17,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:17,577 INFO L933 BasicCegarLoop]: 1926 mSDtfsCounter, 1804 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:17,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1804 Valid, 2033 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.4253790901835595) internal successors, (3572), 2506 states have internal predecessors, (3572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3572 transitions. [2022-01-11 07:41:17,680 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3572 transitions. Word has length 143 [2022-01-11 07:41:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:17,680 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3572 transitions. [2022-01-11 07:41:17,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3572 transitions. [2022-01-11 07:41:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:17,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:17,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:17,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 07:41:17,681 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:17,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1973801959, now seen corresponding path program 1 times [2022-01-11 07:41:17,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:17,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32074685] [2022-01-11 07:41:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:17,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:17,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:17,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32074685] [2022-01-11 07:41:17,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32074685] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:17,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:17,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:17,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107689648] [2022-01-11 07:41:17,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:17,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:17,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:17,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:17,710 INFO L87 Difference]: Start difference. First operand 2507 states and 3572 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:17,851 INFO L93 Difference]: Finished difference Result 4983 states and 7100 transitions. [2022-01-11 07:41:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:17,854 INFO L225 Difference]: With dead ends: 4983 [2022-01-11 07:41:17,854 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:17,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:17,858 INFO L933 BasicCegarLoop]: 1908 mSDtfsCounter, 1786 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:17,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1786 Valid, 2014 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.412609736632083) internal successors, (3540), 2506 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3540 transitions. [2022-01-11 07:41:17,978 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3540 transitions. Word has length 143 [2022-01-11 07:41:17,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:17,978 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3540 transitions. [2022-01-11 07:41:17,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3540 transitions. [2022-01-11 07:41:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:17,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:17,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:17,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 07:41:17,979 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1529656262, now seen corresponding path program 1 times [2022-01-11 07:41:17,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:17,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616020018] [2022-01-11 07:41:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:17,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:18,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:18,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616020018] [2022-01-11 07:41:18,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616020018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:18,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:18,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:18,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78479138] [2022-01-11 07:41:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:18,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:18,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:18,009 INFO L87 Difference]: Start difference. First operand 2507 states and 3540 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:18,149 INFO L93 Difference]: Finished difference Result 4982 states and 7035 transitions. [2022-01-11 07:41:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:18,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:18,152 INFO L225 Difference]: With dead ends: 4982 [2022-01-11 07:41:18,152 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:18,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:18,155 INFO L933 BasicCegarLoop]: 1890 mSDtfsCounter, 1768 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:18,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1768 Valid, 1995 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3998403830806065) internal successors, (3508), 2506 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3508 transitions. [2022-01-11 07:41:18,283 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3508 transitions. Word has length 143 [2022-01-11 07:41:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:18,283 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3508 transitions. [2022-01-11 07:41:18,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3508 transitions. [2022-01-11 07:41:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:18,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:18,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:18,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 07:41:18,287 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -78274267, now seen corresponding path program 1 times [2022-01-11 07:41:18,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:18,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090253251] [2022-01-11 07:41:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:18,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:18,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:18,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090253251] [2022-01-11 07:41:18,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090253251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:18,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:18,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:18,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819032635] [2022-01-11 07:41:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:18,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:18,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:18,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:18,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:18,332 INFO L87 Difference]: Start difference. First operand 2507 states and 3508 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:18,466 INFO L93 Difference]: Finished difference Result 4981 states and 6970 transitions. [2022-01-11 07:41:18,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:18,469 INFO L225 Difference]: With dead ends: 4981 [2022-01-11 07:41:18,469 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:18,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:18,473 INFO L933 BasicCegarLoop]: 1872 mSDtfsCounter, 1750 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:18,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1750 Valid, 1976 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3870710295291302) internal successors, (3476), 2506 states have internal predecessors, (3476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3476 transitions. [2022-01-11 07:41:18,600 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3476 transitions. Word has length 143 [2022-01-11 07:41:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:18,600 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3476 transitions. [2022-01-11 07:41:18,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3476 transitions. [2022-01-11 07:41:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:18,601 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:18,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:18,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 07:41:18,601 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1980858492, now seen corresponding path program 1 times [2022-01-11 07:41:18,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:18,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379952475] [2022-01-11 07:41:18,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:18,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:18,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:18,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379952475] [2022-01-11 07:41:18,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379952475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:18,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:18,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:18,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446894907] [2022-01-11 07:41:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:18,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:18,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:18,632 INFO L87 Difference]: Start difference. First operand 2507 states and 3476 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:18,772 INFO L93 Difference]: Finished difference Result 4980 states and 6905 transitions. [2022-01-11 07:41:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:18,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:18,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:18,775 INFO L225 Difference]: With dead ends: 4980 [2022-01-11 07:41:18,775 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:18,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:18,778 INFO L933 BasicCegarLoop]: 1854 mSDtfsCounter, 1732 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:18,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1732 Valid, 1957 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3743016759776536) internal successors, (3444), 2506 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3444 transitions. [2022-01-11 07:41:18,893 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3444 transitions. Word has length 143 [2022-01-11 07:41:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:18,894 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3444 transitions. [2022-01-11 07:41:18,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3444 transitions. [2022-01-11 07:41:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:18,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:18,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:18,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 07:41:18,895 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1566319773, now seen corresponding path program 1 times [2022-01-11 07:41:18,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:18,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205539820] [2022-01-11 07:41:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:18,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:18,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:18,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205539820] [2022-01-11 07:41:18,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205539820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:18,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:18,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:18,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996679716] [2022-01-11 07:41:18,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:18,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:18,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:18,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:18,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:18,936 INFO L87 Difference]: Start difference. First operand 2507 states and 3444 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:19,101 INFO L93 Difference]: Finished difference Result 4979 states and 6840 transitions. [2022-01-11 07:41:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:19,105 INFO L225 Difference]: With dead ends: 4979 [2022-01-11 07:41:19,105 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:19,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:19,108 INFO L933 BasicCegarLoop]: 1836 mSDtfsCounter, 1714 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:19,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 1938 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3615323224261773) internal successors, (3412), 2506 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3412 transitions. [2022-01-11 07:41:19,245 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3412 transitions. Word has length 143 [2022-01-11 07:41:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:19,245 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3412 transitions. [2022-01-11 07:41:19,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3412 transitions. [2022-01-11 07:41:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:19,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:19,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:19,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 07:41:19,246 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 460486722, now seen corresponding path program 1 times [2022-01-11 07:41:19,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:19,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810570379] [2022-01-11 07:41:19,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:19,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:19,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:19,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810570379] [2022-01-11 07:41:19,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810570379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:19,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:19,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:19,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809193163] [2022-01-11 07:41:19,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:19,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:19,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:19,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:19,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:19,283 INFO L87 Difference]: Start difference. First operand 2507 states and 3412 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:19,439 INFO L93 Difference]: Finished difference Result 4978 states and 6775 transitions. [2022-01-11 07:41:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:19,442 INFO L225 Difference]: With dead ends: 4978 [2022-01-11 07:41:19,442 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:19,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:19,445 INFO L933 BasicCegarLoop]: 1818 mSDtfsCounter, 1696 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:19,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1696 Valid, 1919 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3487629688747007) internal successors, (3380), 2506 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3380 transitions. [2022-01-11 07:41:19,567 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3380 transitions. Word has length 143 [2022-01-11 07:41:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:19,568 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3380 transitions. [2022-01-11 07:41:19,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3380 transitions. [2022-01-11 07:41:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:19,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:19,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:19,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 07:41:19,569 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:19,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1959527073, now seen corresponding path program 1 times [2022-01-11 07:41:19,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:19,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622996237] [2022-01-11 07:41:19,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:19,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:19,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:19,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622996237] [2022-01-11 07:41:19,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622996237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:19,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:19,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:19,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119896437] [2022-01-11 07:41:19,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:19,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:19,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:19,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:19,598 INFO L87 Difference]: Start difference. First operand 2507 states and 3380 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:19,751 INFO L93 Difference]: Finished difference Result 4977 states and 6710 transitions. [2022-01-11 07:41:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:19,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:19,754 INFO L225 Difference]: With dead ends: 4977 [2022-01-11 07:41:19,754 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:19,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:19,757 INFO L933 BasicCegarLoop]: 1800 mSDtfsCounter, 1678 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:19,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1678 Valid, 1900 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3359936153232244) internal successors, (3348), 2506 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3348 transitions. [2022-01-11 07:41:19,937 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3348 transitions. Word has length 143 [2022-01-11 07:41:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:19,937 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3348 transitions. [2022-01-11 07:41:19,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3348 transitions. [2022-01-11 07:41:19,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:19,938 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:19,938 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:19,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 07:41:19,938 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash -686547456, now seen corresponding path program 1 times [2022-01-11 07:41:19,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:19,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030977089] [2022-01-11 07:41:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:19,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:19,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:19,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030977089] [2022-01-11 07:41:19,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030977089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:19,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:19,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:19,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616663198] [2022-01-11 07:41:19,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:19,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:19,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:19,979 INFO L87 Difference]: Start difference. First operand 2507 states and 3348 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:20,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:20,173 INFO L93 Difference]: Finished difference Result 4976 states and 6645 transitions. [2022-01-11 07:41:20,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:20,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:20,176 INFO L225 Difference]: With dead ends: 4976 [2022-01-11 07:41:20,176 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:20,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:20,180 INFO L933 BasicCegarLoop]: 1782 mSDtfsCounter, 1660 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:20,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1660 Valid, 1881 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3232242617717478) internal successors, (3316), 2506 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3316 transitions. [2022-01-11 07:41:20,305 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3316 transitions. Word has length 143 [2022-01-11 07:41:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:20,306 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3316 transitions. [2022-01-11 07:41:20,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3316 transitions. [2022-01-11 07:41:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:20,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:20,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:20,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 07:41:20,307 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash 139040479, now seen corresponding path program 1 times [2022-01-11 07:41:20,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:20,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210469142] [2022-01-11 07:41:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:20,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:20,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:20,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210469142] [2022-01-11 07:41:20,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210469142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:20,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:20,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:20,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562650890] [2022-01-11 07:41:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:20,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:20,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:20,335 INFO L87 Difference]: Start difference. First operand 2507 states and 3316 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:20,492 INFO L93 Difference]: Finished difference Result 4975 states and 6580 transitions. [2022-01-11 07:41:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:20,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:20,495 INFO L225 Difference]: With dead ends: 4975 [2022-01-11 07:41:20,496 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:41:20,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:20,498 INFO L933 BasicCegarLoop]: 1764 mSDtfsCounter, 1642 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:20,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1642 Valid, 1862 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:41:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:41:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2506 states have (on average 1.3104549082202714) internal successors, (3284), 2506 states have internal predecessors, (3284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3284 transitions. [2022-01-11 07:41:20,630 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3284 transitions. Word has length 143 [2022-01-11 07:41:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:20,630 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3284 transitions. [2022-01-11 07:41:20,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3284 transitions. [2022-01-11 07:41:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:20,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:20,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:20,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 07:41:20,631 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash -512823106, now seen corresponding path program 1 times [2022-01-11 07:41:20,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:20,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380438249] [2022-01-11 07:41:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:20,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:20,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:20,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380438249] [2022-01-11 07:41:20,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380438249] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:20,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:20,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:41:20,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731748026] [2022-01-11 07:41:20,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:20,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:41:20,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:20,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:41:20,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:20,676 INFO L87 Difference]: Start difference. First operand 2507 states and 3284 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:21,008 INFO L93 Difference]: Finished difference Result 6044 states and 7978 transitions. [2022-01-11 07:41:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:41:21,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:21,012 INFO L225 Difference]: With dead ends: 6044 [2022-01-11 07:41:21,013 INFO L226 Difference]: Without dead ends: 3597 [2022-01-11 07:41:21,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:41:21,015 INFO L933 BasicCegarLoop]: 1878 mSDtfsCounter, 4781 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 4193 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:21,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4781 Valid, 4193 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:41:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2022-01-11 07:41:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 2513. [2022-01-11 07:41:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2512 states have (on average 1.3001592356687899) internal successors, (3266), 2512 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3266 transitions. [2022-01-11 07:41:21,176 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3266 transitions. Word has length 143 [2022-01-11 07:41:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:21,176 INFO L470 AbstractCegarLoop]: Abstraction has 2513 states and 3266 transitions. [2022-01-11 07:41:21,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3266 transitions. [2022-01-11 07:41:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:21,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:21,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:21,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 07:41:21,177 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:21,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1341522431, now seen corresponding path program 1 times [2022-01-11 07:41:21,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:21,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549676028] [2022-01-11 07:41:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:21,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:21,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:21,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549676028] [2022-01-11 07:41:21,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549676028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:21,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:21,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:41:21,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389493663] [2022-01-11 07:41:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:21,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:41:21,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:41:21,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:21,227 INFO L87 Difference]: Start difference. First operand 2513 states and 3266 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:21,588 INFO L93 Difference]: Finished difference Result 6195 states and 8100 transitions. [2022-01-11 07:41:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:41:21,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:21,592 INFO L225 Difference]: With dead ends: 6195 [2022-01-11 07:41:21,592 INFO L226 Difference]: Without dead ends: 3749 [2022-01-11 07:41:21,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:41:21,594 INFO L933 BasicCegarLoop]: 1847 mSDtfsCounter, 4612 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4612 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:21,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4612 Valid, 4443 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:41:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2022-01-11 07:41:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 2519. [2022-01-11 07:41:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2518 states have (on average 1.289912629070691) internal successors, (3248), 2518 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3248 transitions. [2022-01-11 07:41:21,779 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3248 transitions. Word has length 143 [2022-01-11 07:41:21,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:21,779 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 3248 transitions. [2022-01-11 07:41:21,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:21,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3248 transitions. [2022-01-11 07:41:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:21,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:21,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:21,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 07:41:21,780 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash 812603392, now seen corresponding path program 1 times [2022-01-11 07:41:21,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:21,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678384265] [2022-01-11 07:41:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:21,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:21,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:21,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678384265] [2022-01-11 07:41:21,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678384265] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:21,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:21,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:21,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994547914] [2022-01-11 07:41:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:21,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:21,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:21,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:21,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:21,816 INFO L87 Difference]: Start difference. First operand 2519 states and 3248 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:21,997 INFO L93 Difference]: Finished difference Result 5012 states and 6458 transitions. [2022-01-11 07:41:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:22,000 INFO L225 Difference]: With dead ends: 5012 [2022-01-11 07:41:22,000 INFO L226 Difference]: Without dead ends: 2519 [2022-01-11 07:41:22,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:22,002 INFO L933 BasicCegarLoop]: 1746 mSDtfsCounter, 1637 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:22,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1637 Valid, 1746 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2022-01-11 07:41:22,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2519. [2022-01-11 07:41:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2518 states have (on average 1.2867355043685464) internal successors, (3240), 2518 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3240 transitions. [2022-01-11 07:41:22,186 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3240 transitions. Word has length 143 [2022-01-11 07:41:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:22,186 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 3240 transitions. [2022-01-11 07:41:22,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3240 transitions. [2022-01-11 07:41:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 07:41:22,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:22,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:22,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 07:41:22,187 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1505705089, now seen corresponding path program 1 times [2022-01-11 07:41:22,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:22,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073546098] [2022-01-11 07:41:22,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:22,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:22,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:22,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073546098] [2022-01-11 07:41:22,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073546098] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:22,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:22,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:41:22,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609978212] [2022-01-11 07:41:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:22,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:22,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:22,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:22,233 INFO L87 Difference]: Start difference. First operand 2519 states and 3240 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:22,611 INFO L93 Difference]: Finished difference Result 7342 states and 9457 transitions. [2022-01-11 07:41:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:22,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-11 07:41:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:22,617 INFO L225 Difference]: With dead ends: 7342 [2022-01-11 07:41:22,617 INFO L226 Difference]: Without dead ends: 4864 [2022-01-11 07:41:22,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:22,621 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1575 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:22,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1575 Valid, 3283 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2022-01-11 07:41:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 4712. [2022-01-11 07:41:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4711 states have (on average 1.2842284016132457) internal successors, (6050), 4711 states have internal predecessors, (6050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6050 transitions. [2022-01-11 07:41:22,942 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6050 transitions. Word has length 143 [2022-01-11 07:41:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:22,942 INFO L470 AbstractCegarLoop]: Abstraction has 4712 states and 6050 transitions. [2022-01-11 07:41:22,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6050 transitions. [2022-01-11 07:41:22,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 07:41:22,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:22,945 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:22,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 07:41:22,945 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1187266036, now seen corresponding path program 1 times [2022-01-11 07:41:22,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:22,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067702983] [2022-01-11 07:41:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:22,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:22,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:22,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067702983] [2022-01-11 07:41:22,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067702983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:22,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:22,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:22,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986592508] [2022-01-11 07:41:22,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:22,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:22,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:22,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:22,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:22,995 INFO L87 Difference]: Start difference. First operand 4712 states and 6050 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:23,668 INFO L93 Difference]: Finished difference Result 13863 states and 17822 transitions. [2022-01-11 07:41:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:23,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2022-01-11 07:41:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:23,679 INFO L225 Difference]: With dead ends: 13863 [2022-01-11 07:41:23,679 INFO L226 Difference]: Without dead ends: 9198 [2022-01-11 07:41:23,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:23,684 INFO L933 BasicCegarLoop]: 1731 mSDtfsCounter, 1603 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:23,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1603 Valid, 3280 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9198 states. [2022-01-11 07:41:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9198 to 8900. [2022-01-11 07:41:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8900 states, 8899 states have (on average 1.2821665355657939) internal successors, (11410), 8899 states have internal predecessors, (11410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8900 states to 8900 states and 11410 transitions. [2022-01-11 07:41:24,324 INFO L78 Accepts]: Start accepts. Automaton has 8900 states and 11410 transitions. Word has length 232 [2022-01-11 07:41:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:24,325 INFO L470 AbstractCegarLoop]: Abstraction has 8900 states and 11410 transitions. [2022-01-11 07:41:24,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 8900 states and 11410 transitions. [2022-01-11 07:41:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 07:41:24,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:24,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:24,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 07:41:24,329 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash -574926891, now seen corresponding path program 1 times [2022-01-11 07:41:24,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:24,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819069475] [2022-01-11 07:41:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:24,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:24,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:24,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819069475] [2022-01-11 07:41:24,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819069475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:24,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:24,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:41:24,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344888054] [2022-01-11 07:41:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:24,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:41:24,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:41:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:41:24,379 INFO L87 Difference]: Start difference. First operand 8900 states and 11410 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:25,811 INFO L93 Difference]: Finished difference Result 24868 states and 32031 transitions. [2022-01-11 07:41:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:41:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2022-01-11 07:41:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:25,832 INFO L225 Difference]: With dead ends: 24868 [2022-01-11 07:41:25,832 INFO L226 Difference]: Without dead ends: 16068 [2022-01-11 07:41:25,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:41:25,841 INFO L933 BasicCegarLoop]: 1735 mSDtfsCounter, 3850 mSDsluCounter, 4129 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3850 SdHoareTripleChecker+Valid, 5864 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:25,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3850 Valid, 5864 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:41:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2022-01-11 07:41:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 8924. [2022-01-11 07:41:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8924 states, 8923 states have (on average 1.271881654152191) internal successors, (11349), 8923 states have internal predecessors, (11349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8924 states to 8924 states and 11349 transitions. [2022-01-11 07:41:26,622 INFO L78 Accepts]: Start accepts. Automaton has 8924 states and 11349 transitions. Word has length 232 [2022-01-11 07:41:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:26,622 INFO L470 AbstractCegarLoop]: Abstraction has 8924 states and 11349 transitions. [2022-01-11 07:41:26,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8924 states and 11349 transitions. [2022-01-11 07:41:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 07:41:26,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:26,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:26,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-11 07:41:26,626 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash -884301357, now seen corresponding path program 1 times [2022-01-11 07:41:26,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:26,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715783496] [2022-01-11 07:41:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:26,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:26,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:26,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715783496] [2022-01-11 07:41:26,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715783496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:26,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:26,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:26,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103507638] [2022-01-11 07:41:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:26,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:26,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:26,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:26,683 INFO L87 Difference]: Start difference. First operand 8924 states and 11349 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:28,148 INFO L93 Difference]: Finished difference Result 26329 states and 33324 transitions. [2022-01-11 07:41:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2022-01-11 07:41:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:28,169 INFO L225 Difference]: With dead ends: 26329 [2022-01-11 07:41:28,169 INFO L226 Difference]: Without dead ends: 17543 [2022-01-11 07:41:28,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:28,177 INFO L933 BasicCegarLoop]: 2171 mSDtfsCounter, 1578 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:28,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1578 Valid, 3871 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:28,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17543 states. [2022-01-11 07:41:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17543 to 17261. [2022-01-11 07:41:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17261 states, 17260 states have (on average 1.2607184241019698) internal successors, (21760), 17260 states have internal predecessors, (21760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17261 states to 17261 states and 21760 transitions. [2022-01-11 07:41:29,724 INFO L78 Accepts]: Start accepts. Automaton has 17261 states and 21760 transitions. Word has length 232 [2022-01-11 07:41:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:29,724 INFO L470 AbstractCegarLoop]: Abstraction has 17261 states and 21760 transitions. [2022-01-11 07:41:29,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 17261 states and 21760 transitions. [2022-01-11 07:41:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-11 07:41:29,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:29,730 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:29,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-11 07:41:29,731 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:29,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1684082064, now seen corresponding path program 1 times [2022-01-11 07:41:29,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:29,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818216119] [2022-01-11 07:41:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:29,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:41:29,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:29,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818216119] [2022-01-11 07:41:29,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818216119] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:29,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:29,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:29,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931289995] [2022-01-11 07:41:29,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:29,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:29,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:29,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:29,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:29,761 INFO L87 Difference]: Start difference. First operand 17261 states and 21760 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:31,192 INFO L93 Difference]: Finished difference Result 34340 states and 43299 transitions. [2022-01-11 07:41:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 232 [2022-01-11 07:41:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:31,210 INFO L225 Difference]: With dead ends: 34340 [2022-01-11 07:41:31,211 INFO L226 Difference]: Without dead ends: 17130 [2022-01-11 07:41:31,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:31,220 INFO L933 BasicCegarLoop]: 1732 mSDtfsCounter, 1727 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:31,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1727 Valid, 1733 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2022-01-11 07:41:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 17130. [2022-01-11 07:41:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17130 states, 17129 states have (on average 1.2611360850020432) internal successors, (21602), 17129 states have internal predecessors, (21602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17130 states to 17130 states and 21602 transitions. [2022-01-11 07:41:32,786 INFO L78 Accepts]: Start accepts. Automaton has 17130 states and 21602 transitions. Word has length 232 [2022-01-11 07:41:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:32,787 INFO L470 AbstractCegarLoop]: Abstraction has 17130 states and 21602 transitions. [2022-01-11 07:41:32,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 17130 states and 21602 transitions. [2022-01-11 07:41:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-11 07:41:32,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:32,793 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:32,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-11 07:41:32,793 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:32,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1533888914, now seen corresponding path program 1 times [2022-01-11 07:41:32,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:32,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462678397] [2022-01-11 07:41:32,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:32,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:32,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:32,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462678397] [2022-01-11 07:41:32,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462678397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:32,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:32,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:32,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243166302] [2022-01-11 07:41:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:32,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:32,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:32,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:32,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:32,845 INFO L87 Difference]: Start difference. First operand 17130 states and 21602 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:35,710 INFO L93 Difference]: Finished difference Result 49660 states and 62487 transitions. [2022-01-11 07:41:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:35,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2022-01-11 07:41:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:35,759 INFO L225 Difference]: With dead ends: 49660 [2022-01-11 07:41:35,759 INFO L226 Difference]: Without dead ends: 32668 [2022-01-11 07:41:35,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:35,780 INFO L933 BasicCegarLoop]: 2665 mSDtfsCounter, 1362 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 4376 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-11 07:41:35,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1362 Valid, 4376 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2022-01-11 07:41:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 32666. [2022-01-11 07:41:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32666 states, 32665 states have (on average 1.2554416041634777) internal successors, (41009), 32665 states have internal predecessors, (41009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32666 states to 32666 states and 41009 transitions. [2022-01-11 07:41:38,816 INFO L78 Accepts]: Start accepts. Automaton has 32666 states and 41009 transitions. Word has length 233 [2022-01-11 07:41:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:38,816 INFO L470 AbstractCegarLoop]: Abstraction has 32666 states and 41009 transitions. [2022-01-11 07:41:38,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 32666 states and 41009 transitions. [2022-01-11 07:41:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-01-11 07:41:38,828 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:38,828 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:38,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-11 07:41:38,828 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:38,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1979426225, now seen corresponding path program 1 times [2022-01-11 07:41:38,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:38,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850473119] [2022-01-11 07:41:38,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:38,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:41:38,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:38,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850473119] [2022-01-11 07:41:38,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850473119] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:38,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:38,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:38,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667873025] [2022-01-11 07:41:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:38,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:38,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:38,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:38,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:38,859 INFO L87 Difference]: Start difference. First operand 32666 states and 41009 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:41,736 INFO L93 Difference]: Finished difference Result 65064 states and 81698 transitions. [2022-01-11 07:41:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 233 [2022-01-11 07:41:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:41,782 INFO L225 Difference]: With dead ends: 65064 [2022-01-11 07:41:41,782 INFO L226 Difference]: Without dead ends: 32536 [2022-01-11 07:41:41,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:41,808 INFO L933 BasicCegarLoop]: 1731 mSDtfsCounter, 1725 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:41,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1725 Valid, 1732 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32536 states. [2022-01-11 07:41:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32536 to 32536. [2022-01-11 07:41:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32536 states, 32535 states have (on average 1.2556631320116798) internal successors, (40853), 32535 states have internal predecessors, (40853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32536 states to 32536 states and 40853 transitions. [2022-01-11 07:41:44,754 INFO L78 Accepts]: Start accepts. Automaton has 32536 states and 40853 transitions. Word has length 233 [2022-01-11 07:41:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:44,754 INFO L470 AbstractCegarLoop]: Abstraction has 32536 states and 40853 transitions. [2022-01-11 07:41:44,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32536 states and 40853 transitions. [2022-01-11 07:41:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-01-11 07:41:44,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:44,764 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:44,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-11 07:41:44,765 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:44,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:44,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1142646048, now seen corresponding path program 1 times [2022-01-11 07:41:44,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:44,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452909680] [2022-01-11 07:41:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:44,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:41:44,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:44,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452909680] [2022-01-11 07:41:44,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452909680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:44,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:44,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:44,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914491371] [2022-01-11 07:41:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:44,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:44,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:44,813 INFO L87 Difference]: Start difference. First operand 32536 states and 40853 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:50,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:41:50,399 INFO L93 Difference]: Finished difference Result 94605 states and 118656 transitions. [2022-01-11 07:41:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:41:50,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2022-01-11 07:41:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:41:50,485 INFO L225 Difference]: With dead ends: 94605 [2022-01-11 07:41:50,485 INFO L226 Difference]: Without dead ends: 62207 [2022-01-11 07:41:50,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:50,513 INFO L933 BasicCegarLoop]: 2633 mSDtfsCounter, 1367 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 4342 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:41:50,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1367 Valid, 4342 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:41:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62207 states. [2022-01-11 07:41:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62207 to 62205. [2022-01-11 07:41:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62205 states, 62204 states have (on average 1.2524918011703428) internal successors, (77910), 62204 states have internal predecessors, (77910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62205 states to 62205 states and 77910 transitions. [2022-01-11 07:41:56,361 INFO L78 Accepts]: Start accepts. Automaton has 62205 states and 77910 transitions. Word has length 234 [2022-01-11 07:41:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:41:56,362 INFO L470 AbstractCegarLoop]: Abstraction has 62205 states and 77910 transitions. [2022-01-11 07:41:56,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:41:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 62205 states and 77910 transitions. [2022-01-11 07:41:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-01-11 07:41:56,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:41:56,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:41:56,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-11 07:41:56,386 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:41:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:41:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1588183359, now seen corresponding path program 1 times [2022-01-11 07:41:56,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:41:56,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954006367] [2022-01-11 07:41:56,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:41:56,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:41:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:41:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:41:56,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:41:56,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954006367] [2022-01-11 07:41:56,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954006367] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:41:56,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:41:56,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:41:56,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392308778] [2022-01-11 07:41:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:41:56,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:41:56,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:41:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:41:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:41:56,424 INFO L87 Difference]: Start difference. First operand 62205 states and 77910 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:42:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:42:02,033 INFO L93 Difference]: Finished difference Result 124143 states and 155503 transitions. [2022-01-11 07:42:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:42:02,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 234 [2022-01-11 07:42:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:42:02,124 INFO L225 Difference]: With dead ends: 124143 [2022-01-11 07:42:02,124 INFO L226 Difference]: Without dead ends: 62076 [2022-01-11 07:42:02,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:02,174 INFO L933 BasicCegarLoop]: 1730 mSDtfsCounter, 1723 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:42:02,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1723 Valid, 1731 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:42:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62076 states. [2022-01-11 07:42:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62076 to 62076. [2022-01-11 07:42:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62076 states, 62075 states have (on average 1.252613773660894) internal successors, (77756), 62075 states have internal predecessors, (77756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:42:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62076 states to 62076 states and 77756 transitions. [2022-01-11 07:42:08,121 INFO L78 Accepts]: Start accepts. Automaton has 62076 states and 77756 transitions. Word has length 234 [2022-01-11 07:42:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:42:08,121 INFO L470 AbstractCegarLoop]: Abstraction has 62076 states and 77756 transitions. [2022-01-11 07:42:08,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:42:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 62076 states and 77756 transitions. [2022-01-11 07:42:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-01-11 07:42:08,139 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:42:08,139 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:42:08,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-11 07:42:08,139 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:42:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:42:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1712236481, now seen corresponding path program 1 times [2022-01-11 07:42:08,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:42:08,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560295108] [2022-01-11 07:42:08,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:42:08,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:42:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:42:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:42:08,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:42:08,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560295108] [2022-01-11 07:42:08,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560295108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:42:08,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:42:08,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:42:08,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121712562] [2022-01-11 07:42:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:42:08,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:42:08,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:42:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:42:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:42:08,183 INFO L87 Difference]: Start difference. First operand 62076 states and 77756 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)