/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:03:34,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:03:34,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:03:34,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:03:34,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:03:34,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:03:34,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:03:34,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:03:34,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:03:34,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:03:34,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:03:34,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:03:34,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:03:34,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:03:34,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:03:34,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:03:34,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:03:34,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:03:34,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:03:34,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:03:34,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:03:34,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:03:34,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:03:34,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:03:34,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:03:34,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:03:34,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:03:34,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:03:34,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:03:34,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:03:34,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:03:34,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:03:34,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:03:34,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:03:34,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:03:34,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:03:34,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:03:34,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:03:34,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:03:34,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:03:34,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:03:34,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 20:03:34,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:03:34,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:03:34,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:03:34,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:03:34,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:03:34,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:03:34,177 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:03:34,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:03:34,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:03:34,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:03:34,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:03:34,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:03:34,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:03:34,178 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:03:34,178 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:03:34,178 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:03:34,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:03:34,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:03:34,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:03:34,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:03:34,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:03:34,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:03:34,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:03:34,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:03:34,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:03:34,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:03:34,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:03:34,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:03:34,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:03:34,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:03:34,180 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:03:34,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:03:34,181 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:03:34,181 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:03:34,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:03:34,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:03:34,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:03:34,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:03:34,412 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:03:34,413 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.11.cil-1.c [2022-01-10 20:03:34,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3882c15/89bf7c083ed942838f4d06b4f466f78a/FLAG886fb6f9c [2022-01-10 20:03:34,876 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:03:34,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2022-01-10 20:03:34,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3882c15/89bf7c083ed942838f4d06b4f466f78a/FLAG886fb6f9c [2022-01-10 20:03:34,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3882c15/89bf7c083ed942838f4d06b4f466f78a [2022-01-10 20:03:34,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:03:34,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:03:34,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:03:34,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:03:34,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:03:34,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:03:34" (1/1) ... [2022-01-10 20:03:34,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d89202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:34, skipping insertion in model container [2022-01-10 20:03:34,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:03:34" (1/1) ... [2022-01-10 20:03:34,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:03:34,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:03:35,114 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.11.cil-1.c[914,927] [2022-01-10 20:03:35,153 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.11.cil-1.c[7115,7128] [2022-01-10 20:03:35,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:03:35,303 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:03:35,315 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.11.cil-1.c[914,927] [2022-01-10 20:03:35,339 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.11.cil-1.c[7115,7128] [2022-01-10 20:03:35,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:03:35,400 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:03:35,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35 WrapperNode [2022-01-10 20:03:35,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:03:35,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:03:35,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:03:35,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:03:35,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,534 INFO L137 Inliner]: procedures = 76, calls = 91, calls flagged for inlining = 86, calls inlined = 266, statements flattened = 3958 [2022-01-10 20:03:35,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:03:35,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:03:35,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:03:35,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:03:35,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:03:35,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:03:35,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:03:35,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:03:35,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (1/1) ... [2022-01-10 20:03:35,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:03:35,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:03:35,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:03:35,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:03:35,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:03:35,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:03:35,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:03:35,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:03:35,905 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:03:35,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:03:37,936 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:03:37,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:03:37,950 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-01-10 20:03:37,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:03:37 BoogieIcfgContainer [2022-01-10 20:03:37,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:03:37,954 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:03:37,954 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:03:37,955 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:03:37,957 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:03:37" (1/1) ... [2022-01-10 20:03:38,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:03:38 BasicIcfg [2022-01-10 20:03:38,333 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:03:38,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:03:38,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:03:38,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:03:38,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:03:34" (1/4) ... [2022-01-10 20:03:38,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe94560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:03:38, skipping insertion in model container [2022-01-10 20:03:38,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:03:35" (2/4) ... [2022-01-10 20:03:38,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe94560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:03:38, skipping insertion in model container [2022-01-10 20:03:38,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:03:37" (3/4) ... [2022-01-10 20:03:38,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe94560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:03:38, skipping insertion in model container [2022-01-10 20:03:38,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:03:38" (4/4) ... [2022-01-10 20:03:38,340 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-1.cTransformedIcfg [2022-01-10 20:03:38,344 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:03:38,345 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 20:03:38,388 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:03:38,394 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:03:38,394 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 20:03:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 1684 states, 1679 states have (on average 1.5086360929124478) internal successors, (2533), 1683 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:03:38,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:38,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:38,440 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:38,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:38,449 INFO L85 PathProgramCache]: Analyzing trace with hash 457638608, now seen corresponding path program 1 times [2022-01-10 20:03:38,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:38,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823659783] [2022-01-10 20:03:38,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:38,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:38,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:38,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823659783] [2022-01-10 20:03:38,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823659783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:38,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:38,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:38,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416012628] [2022-01-10 20:03:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:38,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:38,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:38,898 INFO L87 Difference]: Start difference. First operand has 1684 states, 1679 states have (on average 1.5086360929124478) internal successors, (2533), 1683 states have internal predecessors, (2533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:39,088 INFO L93 Difference]: Finished difference Result 3206 states and 4801 transitions. [2022-01-10 20:03:39,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:39,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 20:03:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:39,126 INFO L225 Difference]: With dead ends: 3206 [2022-01-10 20:03:39,126 INFO L226 Difference]: Without dead ends: 1673 [2022-01-10 20:03:39,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:39,141 INFO L933 BasicCegarLoop]: 2487 mSDtfsCounter, 141 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:39,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 4830 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2022-01-10 20:03:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2022-01-10 20:03:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1669 states have (on average 1.4859197124026362) internal successors, (2480), 1672 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2480 transitions. [2022-01-10 20:03:39,256 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2480 transitions. Word has length 44 [2022-01-10 20:03:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:39,257 INFO L470 AbstractCegarLoop]: Abstraction has 1673 states and 2480 transitions. [2022-01-10 20:03:39,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2480 transitions. [2022-01-10 20:03:39,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:03:39,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:39,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:39,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:03:39,260 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 127872847, now seen corresponding path program 1 times [2022-01-10 20:03:39,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984345737] [2022-01-10 20:03:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:39,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:39,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:39,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984345737] [2022-01-10 20:03:39,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984345737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:39,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:39,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:39,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034501862] [2022-01-10 20:03:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:39,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:39,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:39,400 INFO L87 Difference]: Start difference. First operand 1673 states and 2480 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:39,511 INFO L93 Difference]: Finished difference Result 1853 states and 2739 transitions. [2022-01-10 20:03:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 20:03:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:39,521 INFO L225 Difference]: With dead ends: 1853 [2022-01-10 20:03:39,521 INFO L226 Difference]: Without dead ends: 1767 [2022-01-10 20:03:39,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:39,523 INFO L933 BasicCegarLoop]: 2476 mSDtfsCounter, 118 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 4922 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:39,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 4922 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:03:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2022-01-10 20:03:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1763. [2022-01-10 20:03:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1759 states have (on average 1.4786810687890848) internal successors, (2601), 1762 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2601 transitions. [2022-01-10 20:03:39,563 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2601 transitions. Word has length 44 [2022-01-10 20:03:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:39,564 INFO L470 AbstractCegarLoop]: Abstraction has 1763 states and 2601 transitions. [2022-01-10 20:03:39,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2601 transitions. [2022-01-10 20:03:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:03:39,575 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:39,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:39,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:03:39,577 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash 488614097, now seen corresponding path program 1 times [2022-01-10 20:03:39,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:39,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447846505] [2022-01-10 20:03:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:39,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:39,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:39,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447846505] [2022-01-10 20:03:39,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447846505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:39,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:39,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:39,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151414120] [2022-01-10 20:03:39,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:39,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:39,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:39,672 INFO L87 Difference]: Start difference. First operand 1763 states and 2601 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:39,769 INFO L93 Difference]: Finished difference Result 2049 states and 2997 transitions. [2022-01-10 20:03:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 20:03:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:39,776 INFO L225 Difference]: With dead ends: 2049 [2022-01-10 20:03:39,776 INFO L226 Difference]: Without dead ends: 1919 [2022-01-10 20:03:39,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:39,783 INFO L933 BasicCegarLoop]: 2477 mSDtfsCounter, 2440 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2440 SdHoareTripleChecker+Valid, 2594 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-10 20:03:39,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2440 Valid, 2594 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2022-01-10 20:03:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1915. [2022-01-10 20:03:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1911 states have (on average 1.467817896389325) internal successors, (2805), 1914 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2805 transitions. [2022-01-10 20:03:39,833 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2805 transitions. Word has length 44 [2022-01-10 20:03:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:39,833 INFO L470 AbstractCegarLoop]: Abstraction has 1915 states and 2805 transitions. [2022-01-10 20:03:39,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2805 transitions. [2022-01-10 20:03:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:03:39,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:39,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:39,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:03:39,835 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash 857228850, now seen corresponding path program 1 times [2022-01-10 20:03:39,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201786166] [2022-01-10 20:03:39,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:39,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:39,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:39,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201786166] [2022-01-10 20:03:39,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201786166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:39,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:39,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:39,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233953688] [2022-01-10 20:03:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:39,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:39,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:39,906 INFO L87 Difference]: Start difference. First operand 1915 states and 2805 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:39,981 INFO L93 Difference]: Finished difference Result 2463 states and 3561 transitions. [2022-01-10 20:03:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 20:03:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:39,990 INFO L225 Difference]: With dead ends: 2463 [2022-01-10 20:03:39,990 INFO L226 Difference]: Without dead ends: 2128 [2022-01-10 20:03:39,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:39,997 INFO L933 BasicCegarLoop]: 2472 mSDtfsCounter, 93 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 4889 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-10 20:03:39,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 4889 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2022-01-10 20:03:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2114. [2022-01-10 20:03:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2110 states have (on average 1.4563981042654028) internal successors, (3073), 2113 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3073 transitions. [2022-01-10 20:03:40,061 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3073 transitions. Word has length 45 [2022-01-10 20:03:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:40,063 INFO L470 AbstractCegarLoop]: Abstraction has 2114 states and 3073 transitions. [2022-01-10 20:03:40,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3073 transitions. [2022-01-10 20:03:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:03:40,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:40,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:40,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:03:40,065 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash 886811313, now seen corresponding path program 1 times [2022-01-10 20:03:40,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:40,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729602076] [2022-01-10 20:03:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:40,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:40,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:40,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729602076] [2022-01-10 20:03:40,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729602076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:40,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:40,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:40,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090134648] [2022-01-10 20:03:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:40,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:40,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:40,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:40,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:40,130 INFO L87 Difference]: Start difference. First operand 2114 states and 3073 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:40,234 INFO L93 Difference]: Finished difference Result 3002 states and 4285 transitions. [2022-01-10 20:03:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:40,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 20:03:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:40,243 INFO L225 Difference]: With dead ends: 3002 [2022-01-10 20:03:40,243 INFO L226 Difference]: Without dead ends: 2526 [2022-01-10 20:03:40,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:40,245 INFO L933 BasicCegarLoop]: 2472 mSDtfsCounter, 2428 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2428 SdHoareTripleChecker+Valid, 2561 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-10 20:03:40,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2428 Valid, 2561 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2022-01-10 20:03:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2494. [2022-01-10 20:03:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2490 states have (on average 1.4349397590361446) internal successors, (3573), 2493 states have internal predecessors, (3573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 3573 transitions. [2022-01-10 20:03:40,335 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 3573 transitions. Word has length 45 [2022-01-10 20:03:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:40,338 INFO L470 AbstractCegarLoop]: Abstraction has 2494 states and 3573 transitions. [2022-01-10 20:03:40,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 3573 transitions. [2022-01-10 20:03:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:03:40,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:40,344 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-10 20:03:40,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:03:40,345 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1312959410, now seen corresponding path program 1 times [2022-01-10 20:03:40,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:40,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905981607] [2022-01-10 20:03:40,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:40,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:40,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:40,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905981607] [2022-01-10 20:03:40,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905981607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:40,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:40,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:40,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309925108] [2022-01-10 20:03:40,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:40,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:40,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:40,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:40,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:40,408 INFO L87 Difference]: Start difference. First operand 2494 states and 3573 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:40,513 INFO L93 Difference]: Finished difference Result 3697 states and 5186 transitions. [2022-01-10 20:03:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:40,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 20:03:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:40,524 INFO L225 Difference]: With dead ends: 3697 [2022-01-10 20:03:40,524 INFO L226 Difference]: Without dead ends: 2813 [2022-01-10 20:03:40,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:40,529 INFO L933 BasicCegarLoop]: 2476 mSDtfsCounter, 2425 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2425 SdHoareTripleChecker+Valid, 2565 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-10 20:03:40,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2425 Valid, 2565 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2022-01-10 20:03:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2791. [2022-01-10 20:03:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2787 states have (on average 1.4201650520272695) internal successors, (3958), 2790 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3958 transitions. [2022-01-10 20:03:40,642 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3958 transitions. Word has length 51 [2022-01-10 20:03:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:40,643 INFO L470 AbstractCegarLoop]: Abstraction has 2791 states and 3958 transitions. [2022-01-10 20:03:40,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3958 transitions. [2022-01-10 20:03:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:03:40,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:40,644 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-10 20:03:40,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:03:40,645 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2082677865, now seen corresponding path program 1 times [2022-01-10 20:03:40,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069105267] [2022-01-10 20:03:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:40,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:40,737 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-10 20:03:40,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:40,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069105267] [2022-01-10 20:03:40,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069105267] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:40,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:40,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:03:40,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508259259] [2022-01-10 20:03:40,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:40,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:03:40,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:03:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:03:40,739 INFO L87 Difference]: Start difference. First operand 2791 states and 3958 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-10 20:03:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:40,940 INFO L93 Difference]: Finished difference Result 4417 states and 6162 transitions. [2022-01-10 20:03:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:03:40,941 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-10 20:03:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:40,953 INFO L225 Difference]: With dead ends: 4417 [2022-01-10 20:03:40,953 INFO L226 Difference]: Without dead ends: 3466 [2022-01-10 20:03:40,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:03:40,957 INFO L933 BasicCegarLoop]: 2465 mSDtfsCounter, 395 mSDsluCounter, 7504 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 9969 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-10 20:03:40,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 9969 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2022-01-10 20:03:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 2815. [2022-01-10 20:03:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2811 states have (on average 1.4101743151903237) internal successors, (3964), 2814 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3964 transitions. [2022-01-10 20:03:41,115 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3964 transitions. Word has length 52 [2022-01-10 20:03:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:41,115 INFO L470 AbstractCegarLoop]: Abstraction has 2815 states and 3964 transitions. [2022-01-10 20:03:41,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3964 transitions. [2022-01-10 20:03:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:03:41,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:41,117 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:41,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:03:41,117 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -132377610, now seen corresponding path program 1 times [2022-01-10 20:03:41,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000274254] [2022-01-10 20:03:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:41,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:41,182 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-10 20:03:41,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000274254] [2022-01-10 20:03:41,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000274254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:41,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:41,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:03:41,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540809342] [2022-01-10 20:03:41,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:41,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:03:41,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:41,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:03:41,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:03:41,184 INFO L87 Difference]: Start difference. First operand 2815 states and 3964 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-10 20:03:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:41,376 INFO L93 Difference]: Finished difference Result 4570 states and 6313 transitions. [2022-01-10 20:03:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:03:41,377 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-10 20:03:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:41,388 INFO L225 Difference]: With dead ends: 4570 [2022-01-10 20:03:41,389 INFO L226 Difference]: Without dead ends: 3405 [2022-01-10 20:03:41,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:03:41,392 INFO L933 BasicCegarLoop]: 2464 mSDtfsCounter, 354 mSDsluCounter, 7521 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 9985 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-10 20:03:41,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 9985 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2022-01-10 20:03:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 2833. [2022-01-10 20:03:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2829 states have (on average 1.4004948745139625) internal successors, (3962), 2832 states have internal predecessors, (3962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 3962 transitions. [2022-01-10 20:03:41,536 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 3962 transitions. Word has length 52 [2022-01-10 20:03:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:41,536 INFO L470 AbstractCegarLoop]: Abstraction has 2833 states and 3962 transitions. [2022-01-10 20:03:41,536 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-10 20:03:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 3962 transitions. [2022-01-10 20:03:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:03:41,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:41,538 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-10 20:03:41,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:03:41,538 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -121061483, now seen corresponding path program 1 times [2022-01-10 20:03:41,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:41,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652289591] [2022-01-10 20:03:41,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:41,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:41,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:41,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652289591] [2022-01-10 20:03:41,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652289591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:41,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:41,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:03:41,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111988633] [2022-01-10 20:03:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:41,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:03:41,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:03:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:03:41,638 INFO L87 Difference]: Start difference. First operand 2833 states and 3962 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-10 20:03:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:41,862 INFO L93 Difference]: Finished difference Result 3065 states and 4262 transitions. [2022-01-10 20:03:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:03:41,863 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-10 20:03:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:41,874 INFO L225 Difference]: With dead ends: 3065 [2022-01-10 20:03:41,874 INFO L226 Difference]: Without dead ends: 3063 [2022-01-10 20:03:41,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:03:41,878 INFO L933 BasicCegarLoop]: 2473 mSDtfsCounter, 4989 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4989 SdHoareTripleChecker+Valid, 2561 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-10 20:03:41,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4989 Valid, 2561 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2022-01-10 20:03:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 2831. [2022-01-10 20:03:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2828 states have (on average 1.3978076379066477) internal successors, (3953), 2830 states have internal predecessors, (3953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:42,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3953 transitions. [2022-01-10 20:03:42,069 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3953 transitions. Word has length 52 [2022-01-10 20:03:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:42,070 INFO L470 AbstractCegarLoop]: Abstraction has 2831 states and 3953 transitions. [2022-01-10 20:03:42,070 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-10 20:03:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3953 transitions. [2022-01-10 20:03:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 20:03:42,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:42,072 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-10 20:03:42,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:03:42,072 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash 542066732, now seen corresponding path program 1 times [2022-01-10 20:03:42,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:42,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254609763] [2022-01-10 20:03:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:42,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:42,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:42,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254609763] [2022-01-10 20:03:42,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254609763] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:03:42,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307390447] [2022-01-10 20:03:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:42,300 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:03:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:03:42,307 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:03:42,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 20:03:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:42,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 20:03:42,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:03:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:42,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:03:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:43,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307390447] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:03:43,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:03:43,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 20:03:43,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005707477] [2022-01-10 20:03:43,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:03:43,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 20:03:43,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 20:03:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:03:43,062 INFO L87 Difference]: Start difference. First operand 2831 states and 3953 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:43,639 INFO L93 Difference]: Finished difference Result 5188 states and 7053 transitions. [2022-01-10 20:03:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:03:43,639 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-10 20:03:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:43,656 INFO L225 Difference]: With dead ends: 5188 [2022-01-10 20:03:43,656 INFO L226 Difference]: Without dead ends: 5186 [2022-01-10 20:03:43,658 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-10 20:03:43,658 INFO L933 BasicCegarLoop]: 2624 mSDtfsCounter, 7990 mSDsluCounter, 5525 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7990 SdHoareTripleChecker+Valid, 8149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:43,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7990 Valid, 8149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2022-01-10 20:03:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 3806. [2022-01-10 20:03:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3806 states, 3803 states have (on average 1.3762818827241652) internal successors, (5234), 3805 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 5234 transitions. [2022-01-10 20:03:43,989 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 5234 transitions. Word has length 53 [2022-01-10 20:03:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:43,989 INFO L470 AbstractCegarLoop]: Abstraction has 3806 states and 5234 transitions. [2022-01-10 20:03:43,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 5234 transitions. [2022-01-10 20:03:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:03:43,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:43,991 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-10 20:03:44,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 20:03:44,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 20:03:44,207 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:44,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1316239558, now seen corresponding path program 2 times [2022-01-10 20:03:44,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:44,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933420106] [2022-01-10 20:03:44,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:44,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:44,255 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-10 20:03:44,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:44,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933420106] [2022-01-10 20:03:44,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933420106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:44,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:44,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:44,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504685750] [2022-01-10 20:03:44,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:44,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:44,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:44,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:44,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:44,257 INFO L87 Difference]: Start difference. First operand 3806 states and 5234 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-10 20:03:44,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:44,497 INFO L93 Difference]: Finished difference Result 4900 states and 6679 transitions. [2022-01-10 20:03:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:44,498 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-10 20:03:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:44,513 INFO L225 Difference]: With dead ends: 4900 [2022-01-10 20:03:44,514 INFO L226 Difference]: Without dead ends: 3160 [2022-01-10 20:03:44,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:44,518 INFO L933 BasicCegarLoop]: 2536 mSDtfsCounter, 2420 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 2651 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-10 20:03:44,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2420 Valid, 2651 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2022-01-10 20:03:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 3144. [2022-01-10 20:03:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3144 states, 3141 states have (on average 1.378541865647883) internal successors, (4330), 3143 states have internal predecessors, (4330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 4330 transitions. [2022-01-10 20:03:44,724 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 4330 transitions. Word has length 56 [2022-01-10 20:03:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:44,724 INFO L470 AbstractCegarLoop]: Abstraction has 3144 states and 4330 transitions. [2022-01-10 20:03:44,725 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-10 20:03:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 4330 transitions. [2022-01-10 20:03:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 20:03:44,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:44,726 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-10 20:03:44,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:03:44,726 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1139174782, now seen corresponding path program 1 times [2022-01-10 20:03:44,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:44,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190994206] [2022-01-10 20:03:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:44,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:44,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:44,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190994206] [2022-01-10 20:03:44,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190994206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:44,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:44,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:44,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852926768] [2022-01-10 20:03:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:44,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:44,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:44,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:44,781 INFO L87 Difference]: Start difference. First operand 3144 states and 4330 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-10 20:03:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:45,067 INFO L93 Difference]: Finished difference Result 4435 states and 5998 transitions. [2022-01-10 20:03:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:45,068 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-10 20:03:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:45,075 INFO L225 Difference]: With dead ends: 4435 [2022-01-10 20:03:45,075 INFO L226 Difference]: Without dead ends: 3529 [2022-01-10 20:03:45,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:45,077 INFO L933 BasicCegarLoop]: 2536 mSDtfsCounter, 66 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 4992 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:45,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 4992 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2022-01-10 20:03:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 3529. [2022-01-10 20:03:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3529 states, 3526 states have (on average 1.359330686330119) internal successors, (4793), 3528 states have internal predecessors, (4793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4793 transitions. [2022-01-10 20:03:45,337 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4793 transitions. Word has length 60 [2022-01-10 20:03:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:45,337 INFO L470 AbstractCegarLoop]: Abstraction has 3529 states and 4793 transitions. [2022-01-10 20:03:45,337 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-10 20:03:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4793 transitions. [2022-01-10 20:03:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 20:03:45,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:45,339 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-10 20:03:45,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:03:45,339 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:45,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1419782659, now seen corresponding path program 1 times [2022-01-10 20:03:45,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:45,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755630489] [2022-01-10 20:03:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:45,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:45,390 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-10 20:03:45,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:45,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755630489] [2022-01-10 20:03:45,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755630489] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:45,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:45,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:45,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663484655] [2022-01-10 20:03:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:45,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:45,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:45,392 INFO L87 Difference]: Start difference. First operand 3529 states and 4793 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-10 20:03:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:45,643 INFO L93 Difference]: Finished difference Result 5392 states and 7145 transitions. [2022-01-10 20:03:45,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:45,643 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-10 20:03:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:45,650 INFO L225 Difference]: With dead ends: 5392 [2022-01-10 20:03:45,650 INFO L226 Difference]: Without dead ends: 3529 [2022-01-10 20:03:45,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:45,655 INFO L933 BasicCegarLoop]: 2469 mSDtfsCounter, 2412 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 2553 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-10 20:03:45,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2412 Valid, 2553 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2022-01-10 20:03:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 3529. [2022-01-10 20:03:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3529 states, 3526 states have (on average 1.3479863868406126) internal successors, (4753), 3528 states have internal predecessors, (4753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4753 transitions. [2022-01-10 20:03:45,936 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4753 transitions. Word has length 68 [2022-01-10 20:03:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:45,936 INFO L470 AbstractCegarLoop]: Abstraction has 3529 states and 4753 transitions. [2022-01-10 20:03:45,937 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-10 20:03:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4753 transitions. [2022-01-10 20:03:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 20:03:45,939 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:45,939 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-10 20:03:45,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:03:45,939 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 12513869, now seen corresponding path program 1 times [2022-01-10 20:03:45,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:45,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981242873] [2022-01-10 20:03:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:45,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:45,983 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-10 20:03:45,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:45,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981242873] [2022-01-10 20:03:45,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981242873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:45,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:45,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:45,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701866846] [2022-01-10 20:03:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:45,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:45,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:45,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:45,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:45,986 INFO L87 Difference]: Start difference. First operand 3529 states and 4753 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-10 20:03:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:46,211 INFO L93 Difference]: Finished difference Result 4828 states and 6387 transitions. [2022-01-10 20:03:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:46,212 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-10 20:03:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:46,218 INFO L225 Difference]: With dead ends: 4828 [2022-01-10 20:03:46,218 INFO L226 Difference]: Without dead ends: 3203 [2022-01-10 20:03:46,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:46,222 INFO L933 BasicCegarLoop]: 2552 mSDtfsCounter, 99 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:46,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 5003 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2022-01-10 20:03:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3201. [2022-01-10 20:03:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3198 states have (on average 1.3505315822388992) internal successors, (4319), 3200 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4319 transitions. [2022-01-10 20:03:46,413 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4319 transitions. Word has length 69 [2022-01-10 20:03:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:46,414 INFO L470 AbstractCegarLoop]: Abstraction has 3201 states and 4319 transitions. [2022-01-10 20:03:46,427 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-10 20:03:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4319 transitions. [2022-01-10 20:03:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 20:03:46,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:46,430 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-10 20:03:46,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:03:46,431 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1423599378, now seen corresponding path program 1 times [2022-01-10 20:03:46,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:46,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060140196] [2022-01-10 20:03:46,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:46,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:46,464 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-10 20:03:46,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:46,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060140196] [2022-01-10 20:03:46,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060140196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:46,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:46,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:46,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937761640] [2022-01-10 20:03:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:46,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:46,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:46,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:46,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:46,468 INFO L87 Difference]: Start difference. First operand 3201 states and 4319 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-10 20:03:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:46,705 INFO L93 Difference]: Finished difference Result 4845 states and 6423 transitions. [2022-01-10 20:03:46,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:46,705 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-10 20:03:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:46,715 INFO L225 Difference]: With dead ends: 4845 [2022-01-10 20:03:46,715 INFO L226 Difference]: Without dead ends: 3477 [2022-01-10 20:03:46,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:46,719 INFO L933 BasicCegarLoop]: 2463 mSDtfsCounter, 2443 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2443 SdHoareTripleChecker+Valid, 2551 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-10 20:03:46,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2443 Valid, 2551 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2022-01-10 20:03:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3438. [2022-01-10 20:03:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3435 states have (on average 1.3557496360989811) internal successors, (4657), 3437 states have internal predecessors, (4657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4657 transitions. [2022-01-10 20:03:46,978 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4657 transitions. Word has length 100 [2022-01-10 20:03:46,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:46,979 INFO L470 AbstractCegarLoop]: Abstraction has 3438 states and 4657 transitions. [2022-01-10 20:03:46,979 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-10 20:03:46,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4657 transitions. [2022-01-10 20:03:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 20:03:46,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:46,981 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-10 20:03:46,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:03:46,981 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -690405498, now seen corresponding path program 1 times [2022-01-10 20:03:46,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:46,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707570841] [2022-01-10 20:03:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:46,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:47,024 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-10 20:03:47,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:47,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707570841] [2022-01-10 20:03:47,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707570841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:47,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:47,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:47,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680946027] [2022-01-10 20:03:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:47,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:47,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:47,026 INFO L87 Difference]: Start difference. First operand 3438 states and 4657 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-10 20:03:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:47,249 INFO L93 Difference]: Finished difference Result 5047 states and 6702 transitions. [2022-01-10 20:03:47,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:47,249 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-10 20:03:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:47,257 INFO L225 Difference]: With dead ends: 5047 [2022-01-10 20:03:47,257 INFO L226 Difference]: Without dead ends: 3446 [2022-01-10 20:03:47,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:47,260 INFO L933 BasicCegarLoop]: 2451 mSDtfsCounter, 69 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 4792 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-10 20:03:47,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 4792 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2022-01-10 20:03:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3446. [2022-01-10 20:03:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 3443 states have (on average 1.3473714783618937) internal successors, (4639), 3445 states have internal predecessors, (4639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 4639 transitions. [2022-01-10 20:03:47,477 INFO L78 Accepts]: Start accepts. Automaton has 3446 states and 4639 transitions. Word has length 110 [2022-01-10 20:03:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:47,477 INFO L470 AbstractCegarLoop]: Abstraction has 3446 states and 4639 transitions. [2022-01-10 20:03:47,477 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-10 20:03:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3446 states and 4639 transitions. [2022-01-10 20:03:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 20:03:47,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:47,479 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-10 20:03:47,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:03:47,480 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash -930945627, now seen corresponding path program 1 times [2022-01-10 20:03:47,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:47,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162872430] [2022-01-10 20:03:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:47,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:47,537 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-10 20:03:47,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:47,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162872430] [2022-01-10 20:03:47,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162872430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:47,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:47,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:47,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128272132] [2022-01-10 20:03:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:47,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:47,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:47,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:47,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:47,539 INFO L87 Difference]: Start difference. First operand 3446 states and 4639 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-10 20:03:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:47,719 INFO L93 Difference]: Finished difference Result 4209 states and 5597 transitions. [2022-01-10 20:03:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:47,720 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-10 20:03:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:47,725 INFO L225 Difference]: With dead ends: 4209 [2022-01-10 20:03:47,725 INFO L226 Difference]: Without dead ends: 2600 [2022-01-10 20:03:47,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:47,729 INFO L933 BasicCegarLoop]: 2454 mSDtfsCounter, 2416 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 2475 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-10 20:03:47,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2416 Valid, 2475 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2022-01-10 20:03:47,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2600. [2022-01-10 20:03:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2597 states have (on average 1.3692722371967656) internal successors, (3556), 2599 states have internal predecessors, (3556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3556 transitions. [2022-01-10 20:03:47,892 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3556 transitions. Word has length 110 [2022-01-10 20:03:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:47,892 INFO L470 AbstractCegarLoop]: Abstraction has 2600 states and 3556 transitions. [2022-01-10 20:03:47,893 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-10 20:03:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3556 transitions. [2022-01-10 20:03:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 20:03:47,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:47,895 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-10 20:03:47,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:03:47,896 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1209994835, now seen corresponding path program 1 times [2022-01-10 20:03:47,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:47,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064756311] [2022-01-10 20:03:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:47,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:47,946 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-10 20:03:47,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:47,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064756311] [2022-01-10 20:03:47,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064756311] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:47,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:47,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:47,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722586354] [2022-01-10 20:03:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:47,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:47,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:47,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:47,949 INFO L87 Difference]: Start difference. First operand 2600 states and 3556 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-10 20:03:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:48,158 INFO L93 Difference]: Finished difference Result 3372 states and 4500 transitions. [2022-01-10 20:03:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:48,158 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-10 20:03:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:48,164 INFO L225 Difference]: With dead ends: 3372 [2022-01-10 20:03:48,164 INFO L226 Difference]: Without dead ends: 2609 [2022-01-10 20:03:48,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:48,166 INFO L933 BasicCegarLoop]: 2453 mSDtfsCounter, 60 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 4796 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-10 20:03:48,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 4796 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-01-10 20:03:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2609. [2022-01-10 20:03:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2606 states have (on average 1.3626247122026094) internal successors, (3551), 2608 states have internal predecessors, (3551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3551 transitions. [2022-01-10 20:03:48,364 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3551 transitions. Word has length 113 [2022-01-10 20:03:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:48,364 INFO L470 AbstractCegarLoop]: Abstraction has 2609 states and 3551 transitions. [2022-01-10 20:03:48,364 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-10 20:03:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3551 transitions. [2022-01-10 20:03:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 20:03:48,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:48,366 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-10 20:03:48,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:03:48,367 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:48,367 INFO L85 PathProgramCache]: Analyzing trace with hash 761298196, now seen corresponding path program 1 times [2022-01-10 20:03:48,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:48,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833382337] [2022-01-10 20:03:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:48,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:48,431 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-10 20:03:48,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:48,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833382337] [2022-01-10 20:03:48,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833382337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:48,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:48,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:48,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936547896] [2022-01-10 20:03:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:48,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:48,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:48,434 INFO L87 Difference]: Start difference. First operand 2609 states and 3551 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-10 20:03:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:48,570 INFO L93 Difference]: Finished difference Result 3004 states and 4014 transitions. [2022-01-10 20:03:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:48,570 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-10 20:03:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:48,573 INFO L225 Difference]: With dead ends: 3004 [2022-01-10 20:03:48,573 INFO L226 Difference]: Without dead ends: 1576 [2022-01-10 20:03:48,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:48,575 INFO L933 BasicCegarLoop]: 2450 mSDtfsCounter, 2401 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 2468 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-10 20:03:48,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2401 Valid, 2468 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-01-10 20:03:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2022-01-10 20:03:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1574 states have (on average 1.486022871664549) internal successors, (2339), 1575 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2339 transitions. [2022-01-10 20:03:48,632 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2339 transitions. Word has length 113 [2022-01-10 20:03:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:48,632 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2339 transitions. [2022-01-10 20:03:48,632 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-10 20:03:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2339 transitions. [2022-01-10 20:03:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:48,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:48,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:48,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:03:48,634 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -857232545, now seen corresponding path program 1 times [2022-01-10 20:03:48,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:48,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841400539] [2022-01-10 20:03:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:48,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:48,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:48,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841400539] [2022-01-10 20:03:48,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841400539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:48,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:48,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:48,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213714614] [2022-01-10 20:03:48,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:48,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:48,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:48,687 INFO L87 Difference]: Start difference. First operand 1576 states and 2339 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:48,755 INFO L93 Difference]: Finished difference Result 3136 states and 4651 transitions. [2022-01-10 20:03:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:48,759 INFO L225 Difference]: With dead ends: 3136 [2022-01-10 20:03:48,759 INFO L226 Difference]: Without dead ends: 1576 [2022-01-10 20:03:48,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:48,762 INFO L933 BasicCegarLoop]: 2337 mSDtfsCounter, 2323 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:48,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2323 Valid, 2338 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-01-10 20:03:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2022-01-10 20:03:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1574 states have (on average 1.4853875476493013) internal successors, (2338), 1575 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2338 transitions. [2022-01-10 20:03:48,856 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2338 transitions. Word has length 154 [2022-01-10 20:03:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:48,857 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2338 transitions. [2022-01-10 20:03:48,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2338 transitions. [2022-01-10 20:03:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:48,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:48,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:48,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:03:48,858 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 36702366, now seen corresponding path program 1 times [2022-01-10 20:03:48,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:48,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431465370] [2022-01-10 20:03:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:48,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:48,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431465370] [2022-01-10 20:03:48,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431465370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:48,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:48,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:48,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987551159] [2022-01-10 20:03:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:48,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:48,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:48,912 INFO L87 Difference]: Start difference. First operand 1576 states and 2338 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:49,038 INFO L93 Difference]: Finished difference Result 4471 states and 6613 transitions. [2022-01-10 20:03:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:49,045 INFO L225 Difference]: With dead ends: 4471 [2022-01-10 20:03:49,045 INFO L226 Difference]: Without dead ends: 2914 [2022-01-10 20:03:49,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:49,048 INFO L933 BasicCegarLoop]: 2332 mSDtfsCounter, 2192 mSDsluCounter, 2084 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 4416 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:49,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2192 Valid, 4416 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2022-01-10 20:03:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2910. [2022-01-10 20:03:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4786795048143053) internal successors, (4300), 2909 states have internal predecessors, (4300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4300 transitions. [2022-01-10 20:03:49,172 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4300 transitions. Word has length 154 [2022-01-10 20:03:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:49,172 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4300 transitions. [2022-01-10 20:03:49,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4300 transitions. [2022-01-10 20:03:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:49,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:49,174 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:49,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:03:49,174 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:49,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1470446782, now seen corresponding path program 1 times [2022-01-10 20:03:49,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:49,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747329127] [2022-01-10 20:03:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:49,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:49,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:49,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747329127] [2022-01-10 20:03:49,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747329127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:49,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:49,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:49,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612460920] [2022-01-10 20:03:49,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:49,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:49,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:49,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:49,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:49,224 INFO L87 Difference]: Start difference. First operand 2910 states and 4300 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:49,353 INFO L93 Difference]: Finished difference Result 5800 states and 8568 transitions. [2022-01-10 20:03:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:49,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:49,360 INFO L225 Difference]: With dead ends: 5800 [2022-01-10 20:03:49,360 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:49,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:49,366 INFO L933 BasicCegarLoop]: 2326 mSDtfsCounter, 2312 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:49,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2312 Valid, 2326 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4759284731774416) internal successors, (4292), 2909 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4292 transitions. [2022-01-10 20:03:49,547 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4292 transitions. Word has length 154 [2022-01-10 20:03:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:49,547 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4292 transitions. [2022-01-10 20:03:49,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4292 transitions. [2022-01-10 20:03:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:49,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:49,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:49,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:03:49,549 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:49,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:49,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1655243934, now seen corresponding path program 1 times [2022-01-10 20:03:49,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:49,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822926430] [2022-01-10 20:03:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:49,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:49,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:49,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822926430] [2022-01-10 20:03:49,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822926430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:49,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:49,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:49,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862258754] [2022-01-10 20:03:49,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:49,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:49,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:49,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:49,598 INFO L87 Difference]: Start difference. First operand 2910 states and 4292 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:49,740 INFO L93 Difference]: Finished difference Result 5799 states and 8551 transitions. [2022-01-10 20:03:49,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:49,746 INFO L225 Difference]: With dead ends: 5799 [2022-01-10 20:03:49,746 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:49,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:49,751 INFO L933 BasicCegarLoop]: 2321 mSDtfsCounter, 2306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2306 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:49,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2306 Valid, 2321 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4731774415405776) internal successors, (4284), 2909 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4284 transitions. [2022-01-10 20:03:49,883 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4284 transitions. Word has length 154 [2022-01-10 20:03:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:49,883 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4284 transitions. [2022-01-10 20:03:49,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4284 transitions. [2022-01-10 20:03:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:49,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:49,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:49,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:03:49,885 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:49,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash -971194178, now seen corresponding path program 1 times [2022-01-10 20:03:49,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:49,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941315108] [2022-01-10 20:03:49,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:49,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:49,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:49,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941315108] [2022-01-10 20:03:49,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941315108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:49,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:49,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:49,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013114258] [2022-01-10 20:03:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:49,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:49,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:49,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:49,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:49,931 INFO L87 Difference]: Start difference. First operand 2910 states and 4284 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:50,057 INFO L93 Difference]: Finished difference Result 5798 states and 8534 transitions. [2022-01-10 20:03:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:50,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:50,061 INFO L225 Difference]: With dead ends: 5798 [2022-01-10 20:03:50,062 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:50,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:50,066 INFO L933 BasicCegarLoop]: 2316 mSDtfsCounter, 2300 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2300 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:50,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2300 Valid, 2316 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4704264099037139) internal successors, (4276), 2909 states have internal predecessors, (4276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4276 transitions. [2022-01-10 20:03:50,224 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4276 transitions. Word has length 154 [2022-01-10 20:03:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:50,225 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4276 transitions. [2022-01-10 20:03:50,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4276 transitions. [2022-01-10 20:03:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:50,226 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:50,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:50,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:03:50,227 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:50,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:50,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1160839326, now seen corresponding path program 1 times [2022-01-10 20:03:50,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:50,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563984923] [2022-01-10 20:03:50,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:50,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:50,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:50,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563984923] [2022-01-10 20:03:50,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563984923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:50,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:50,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:50,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163017128] [2022-01-10 20:03:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:50,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:50,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:50,271 INFO L87 Difference]: Start difference. First operand 2910 states and 4276 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:50,416 INFO L93 Difference]: Finished difference Result 5797 states and 8517 transitions. [2022-01-10 20:03:50,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:50,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:50,422 INFO L225 Difference]: With dead ends: 5797 [2022-01-10 20:03:50,422 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:50,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:50,427 INFO L933 BasicCegarLoop]: 2311 mSDtfsCounter, 2294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2294 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:50,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2294 Valid, 2311 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4676753782668501) internal successors, (4268), 2909 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4268 transitions. [2022-01-10 20:03:50,569 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4268 transitions. Word has length 154 [2022-01-10 20:03:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:50,569 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4268 transitions. [2022-01-10 20:03:50,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4268 transitions. [2022-01-10 20:03:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:50,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:50,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:50,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:03:50,571 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1264237378, now seen corresponding path program 1 times [2022-01-10 20:03:50,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:50,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499465079] [2022-01-10 20:03:50,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:50,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:50,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499465079] [2022-01-10 20:03:50,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499465079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:50,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:50,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:50,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779934549] [2022-01-10 20:03:50,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:50,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:50,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:50,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:50,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:50,620 INFO L87 Difference]: Start difference. First operand 2910 states and 4268 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:50,773 INFO L93 Difference]: Finished difference Result 5796 states and 8500 transitions. [2022-01-10 20:03:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:50,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:50,780 INFO L225 Difference]: With dead ends: 5796 [2022-01-10 20:03:50,780 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:50,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:50,785 INFO L933 BasicCegarLoop]: 2306 mSDtfsCounter, 2288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:50,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2288 Valid, 2306 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4649243466299862) internal successors, (4260), 2909 states have internal predecessors, (4260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4260 transitions. [2022-01-10 20:03:50,992 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4260 transitions. Word has length 154 [2022-01-10 20:03:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:50,992 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4260 transitions. [2022-01-10 20:03:50,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4260 transitions. [2022-01-10 20:03:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:50,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:50,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:50,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:03:50,994 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash -511181666, now seen corresponding path program 1 times [2022-01-10 20:03:50,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:50,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136284842] [2022-01-10 20:03:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:50,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:51,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:51,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136284842] [2022-01-10 20:03:51,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136284842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:51,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:51,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:51,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060712501] [2022-01-10 20:03:51,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:51,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:51,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:51,040 INFO L87 Difference]: Start difference. First operand 2910 states and 4260 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:51,259 INFO L93 Difference]: Finished difference Result 5794 states and 8481 transitions. [2022-01-10 20:03:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:51,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:51,265 INFO L225 Difference]: With dead ends: 5794 [2022-01-10 20:03:51,265 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:51,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:51,270 INFO L933 BasicCegarLoop]: 2301 mSDtfsCounter, 2281 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:51,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2281 Valid, 2301 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4621733149931224) internal successors, (4252), 2909 states have internal predecessors, (4252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4252 transitions. [2022-01-10 20:03:51,441 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4252 transitions. Word has length 154 [2022-01-10 20:03:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:51,441 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4252 transitions. [2022-01-10 20:03:51,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4252 transitions. [2022-01-10 20:03:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:51,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:51,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:51,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 20:03:51,442 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1299655806, now seen corresponding path program 1 times [2022-01-10 20:03:51,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:51,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394065691] [2022-01-10 20:03:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:51,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:51,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:51,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394065691] [2022-01-10 20:03:51,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394065691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:51,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:51,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:51,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162002678] [2022-01-10 20:03:51,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:51,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:51,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:51,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:51,484 INFO L87 Difference]: Start difference. First operand 2910 states and 4252 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:51,636 INFO L93 Difference]: Finished difference Result 5793 states and 8464 transitions. [2022-01-10 20:03:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:51,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:51,641 INFO L225 Difference]: With dead ends: 5793 [2022-01-10 20:03:51,642 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:51,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:51,646 INFO L933 BasicCegarLoop]: 2296 mSDtfsCounter, 2275 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2275 SdHoareTripleChecker+Valid, 2296 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:51,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2275 Valid, 2296 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4594222833562587) internal successors, (4244), 2909 states have internal predecessors, (4244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4244 transitions. [2022-01-10 20:03:51,802 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4244 transitions. Word has length 154 [2022-01-10 20:03:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:51,802 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4244 transitions. [2022-01-10 20:03:51,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4244 transitions. [2022-01-10 20:03:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:51,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:51,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:51,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 20:03:51,804 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1358069918, now seen corresponding path program 1 times [2022-01-10 20:03:51,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:51,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113119591] [2022-01-10 20:03:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:51,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:51,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:51,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113119591] [2022-01-10 20:03:51,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113119591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:51,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:51,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:51,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823521989] [2022-01-10 20:03:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:51,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:51,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:51,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:51,842 INFO L87 Difference]: Start difference. First operand 2910 states and 4244 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:52,009 INFO L93 Difference]: Finished difference Result 5792 states and 8447 transitions. [2022-01-10 20:03:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:52,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:52,014 INFO L225 Difference]: With dead ends: 5792 [2022-01-10 20:03:52,014 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:52,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:52,018 INFO L933 BasicCegarLoop]: 2291 mSDtfsCounter, 2269 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:52,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2269 Valid, 2291 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:52,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4566712517193947) internal successors, (4236), 2909 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4236 transitions. [2022-01-10 20:03:52,171 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4236 transitions. Word has length 154 [2022-01-10 20:03:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:52,172 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4236 transitions. [2022-01-10 20:03:52,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4236 transitions. [2022-01-10 20:03:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:52,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:52,173 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:52,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 20:03:52,173 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -995350402, now seen corresponding path program 1 times [2022-01-10 20:03:52,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:52,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981049317] [2022-01-10 20:03:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:52,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:52,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:52,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981049317] [2022-01-10 20:03:52,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981049317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:52,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:52,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:52,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970844282] [2022-01-10 20:03:52,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:52,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:52,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:52,213 INFO L87 Difference]: Start difference. First operand 2910 states and 4236 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:52,385 INFO L93 Difference]: Finished difference Result 5790 states and 8428 transitions. [2022-01-10 20:03:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:52,390 INFO L225 Difference]: With dead ends: 5790 [2022-01-10 20:03:52,390 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:52,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:52,395 INFO L933 BasicCegarLoop]: 2286 mSDtfsCounter, 2262 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2262 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:52,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2262 Valid, 2286 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.453920220082531) internal successors, (4228), 2909 states have internal predecessors, (4228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4228 transitions. [2022-01-10 20:03:52,513 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4228 transitions. Word has length 154 [2022-01-10 20:03:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:52,513 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4228 transitions. [2022-01-10 20:03:52,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4228 transitions. [2022-01-10 20:03:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:52,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:52,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:52,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 20:03:52,515 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:52,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 544098398, now seen corresponding path program 1 times [2022-01-10 20:03:52,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:52,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679418266] [2022-01-10 20:03:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:52,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:52,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:52,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679418266] [2022-01-10 20:03:52,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679418266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:52,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:52,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:52,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732291386] [2022-01-10 20:03:52,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:52,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:52,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:52,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:52,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:52,557 INFO L87 Difference]: Start difference. First operand 2910 states and 4228 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:52,754 INFO L93 Difference]: Finished difference Result 5789 states and 8411 transitions. [2022-01-10 20:03:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:52,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:52,757 INFO L225 Difference]: With dead ends: 5789 [2022-01-10 20:03:52,757 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:52,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:52,760 INFO L933 BasicCegarLoop]: 2253 mSDtfsCounter, 2120 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:52,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2120 Valid, 2371 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4422283356258596) internal successors, (4194), 2909 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4194 transitions. [2022-01-10 20:03:52,932 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4194 transitions. Word has length 154 [2022-01-10 20:03:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:52,932 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4194 transitions. [2022-01-10 20:03:52,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4194 transitions. [2022-01-10 20:03:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:52,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:52,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:52,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 20:03:52,934 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -975800835, now seen corresponding path program 1 times [2022-01-10 20:03:52,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:52,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322310553] [2022-01-10 20:03:52,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:52,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:52,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:52,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322310553] [2022-01-10 20:03:52,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322310553] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:52,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:52,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:52,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941757844] [2022-01-10 20:03:52,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:52,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:52,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:52,977 INFO L87 Difference]: Start difference. First operand 2910 states and 4194 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:53,155 INFO L93 Difference]: Finished difference Result 5788 states and 8342 transitions. [2022-01-10 20:03:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:53,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:53,158 INFO L225 Difference]: With dead ends: 5788 [2022-01-10 20:03:53,158 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:53,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:53,161 INFO L933 BasicCegarLoop]: 2234 mSDtfsCounter, 2101 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:53,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2101 Valid, 2351 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4305364511691885) internal successors, (4160), 2909 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4160 transitions. [2022-01-10 20:03:53,344 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4160 transitions. Word has length 154 [2022-01-10 20:03:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:53,345 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4160 transitions. [2022-01-10 20:03:53,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4160 transitions. [2022-01-10 20:03:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:53,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:53,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 20:03:53,346 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash 934650524, now seen corresponding path program 1 times [2022-01-10 20:03:53,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:53,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001701329] [2022-01-10 20:03:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:53,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:53,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:53,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001701329] [2022-01-10 20:03:53,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001701329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:53,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:53,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:53,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154097538] [2022-01-10 20:03:53,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:53,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:53,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:53,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:53,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:53,396 INFO L87 Difference]: Start difference. First operand 2910 states and 4160 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:53,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:53,632 INFO L93 Difference]: Finished difference Result 5787 states and 8273 transitions. [2022-01-10 20:03:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:53,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:53,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:53,637 INFO L225 Difference]: With dead ends: 5787 [2022-01-10 20:03:53,637 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:53,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:53,641 INFO L933 BasicCegarLoop]: 2215 mSDtfsCounter, 2082 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:53,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2082 Valid, 2331 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.4188445667125171) internal successors, (4126), 2909 states have internal predecessors, (4126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4126 transitions. [2022-01-10 20:03:53,802 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4126 transitions. Word has length 154 [2022-01-10 20:03:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:53,803 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4126 transitions. [2022-01-10 20:03:53,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4126 transitions. [2022-01-10 20:03:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:53,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:53,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:53,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 20:03:53,804 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1411162437, now seen corresponding path program 1 times [2022-01-10 20:03:53,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:53,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543321148] [2022-01-10 20:03:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:53,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:53,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-10 20:03:53,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:53,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543321148] [2022-01-10 20:03:53,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543321148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:53,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:53,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:53,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191080011] [2022-01-10 20:03:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:53,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:53,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:53,847 INFO L87 Difference]: Start difference. First operand 2910 states and 4126 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:54,060 INFO L93 Difference]: Finished difference Result 5786 states and 8204 transitions. [2022-01-10 20:03:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:54,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:54,064 INFO L225 Difference]: With dead ends: 5786 [2022-01-10 20:03:54,064 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:54,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:54,068 INFO L933 BasicCegarLoop]: 2196 mSDtfsCounter, 2063 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:54,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2063 Valid, 2311 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.407152682255846) internal successors, (4092), 2909 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4092 transitions. [2022-01-10 20:03:54,220 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4092 transitions. Word has length 154 [2022-01-10 20:03:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:54,221 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4092 transitions. [2022-01-10 20:03:54,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4092 transitions. [2022-01-10 20:03:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:54,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:54,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:54,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 20:03:54,222 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 443083226, now seen corresponding path program 1 times [2022-01-10 20:03:54,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:54,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56473323] [2022-01-10 20:03:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:54,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:54,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:54,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56473323] [2022-01-10 20:03:54,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56473323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:54,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:54,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:54,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330666083] [2022-01-10 20:03:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:54,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:54,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:54,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:54,266 INFO L87 Difference]: Start difference. First operand 2910 states and 4092 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:54,457 INFO L93 Difference]: Finished difference Result 5785 states and 8135 transitions. [2022-01-10 20:03:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:54,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:54,460 INFO L225 Difference]: With dead ends: 5785 [2022-01-10 20:03:54,460 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:54,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:54,463 INFO L933 BasicCegarLoop]: 2177 mSDtfsCounter, 2044 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:54,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2044 Valid, 2291 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:54,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.3954607977991746) internal successors, (4058), 2909 states have internal predecessors, (4058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4058 transitions. [2022-01-10 20:03:54,587 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4058 transitions. Word has length 154 [2022-01-10 20:03:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:54,587 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4058 transitions. [2022-01-10 20:03:54,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4058 transitions. [2022-01-10 20:03:54,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:54,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:54,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:54,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 20:03:54,589 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1110182791, now seen corresponding path program 1 times [2022-01-10 20:03:54,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219268004] [2022-01-10 20:03:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:54,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:54,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-10 20:03:54,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:54,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219268004] [2022-01-10 20:03:54,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219268004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:54,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:54,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:54,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625375915] [2022-01-10 20:03:54,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:54,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:54,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:54,632 INFO L87 Difference]: Start difference. First operand 2910 states and 4058 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:54,840 INFO L93 Difference]: Finished difference Result 5784 states and 8066 transitions. [2022-01-10 20:03:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:54,843 INFO L225 Difference]: With dead ends: 5784 [2022-01-10 20:03:54,843 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:54,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:54,845 INFO L933 BasicCegarLoop]: 2158 mSDtfsCounter, 2025 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:54,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2025 Valid, 2271 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.3837689133425035) internal successors, (4024), 2909 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4024 transitions. [2022-01-10 20:03:55,034 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4024 transitions. Word has length 154 [2022-01-10 20:03:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:55,034 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 4024 transitions. [2022-01-10 20:03:55,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4024 transitions. [2022-01-10 20:03:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:55,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:55,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:55,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 20:03:55,035 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1165779432, now seen corresponding path program 1 times [2022-01-10 20:03:55,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268499016] [2022-01-10 20:03:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:55,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:55,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:55,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268499016] [2022-01-10 20:03:55,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268499016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:55,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:55,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:55,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202183159] [2022-01-10 20:03:55,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:55,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:55,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:55,076 INFO L87 Difference]: Start difference. First operand 2910 states and 4024 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:55,283 INFO L93 Difference]: Finished difference Result 5783 states and 7997 transitions. [2022-01-10 20:03:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:55,286 INFO L225 Difference]: With dead ends: 5783 [2022-01-10 20:03:55,286 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:55,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:55,289 INFO L933 BasicCegarLoop]: 2139 mSDtfsCounter, 2006 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2006 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:55,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2006 Valid, 2251 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.3720770288858322) internal successors, (3990), 2909 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3990 transitions. [2022-01-10 20:03:55,469 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3990 transitions. Word has length 154 [2022-01-10 20:03:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:55,469 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3990 transitions. [2022-01-10 20:03:55,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3990 transitions. [2022-01-10 20:03:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:55,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:55,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:55,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 20:03:55,471 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:55,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2026092343, now seen corresponding path program 1 times [2022-01-10 20:03:55,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:55,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031362998] [2022-01-10 20:03:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:55,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:55,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:55,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031362998] [2022-01-10 20:03:55,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031362998] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:55,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:55,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:55,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745810445] [2022-01-10 20:03:55,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:55,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:55,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:55,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:55,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:55,518 INFO L87 Difference]: Start difference. First operand 2910 states and 3990 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:55,752 INFO L93 Difference]: Finished difference Result 5782 states and 7928 transitions. [2022-01-10 20:03:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:55,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:55,757 INFO L225 Difference]: With dead ends: 5782 [2022-01-10 20:03:55,757 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:55,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:55,760 INFO L933 BasicCegarLoop]: 2120 mSDtfsCounter, 1987 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1987 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:55,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1987 Valid, 2231 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.360385144429161) internal successors, (3956), 2909 states have internal predecessors, (3956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3956 transitions. [2022-01-10 20:03:55,994 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3956 transitions. Word has length 154 [2022-01-10 20:03:55,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:55,994 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3956 transitions. [2022-01-10 20:03:55,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3956 transitions. [2022-01-10 20:03:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:55,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:55,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:55,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 20:03:55,995 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -683589802, now seen corresponding path program 1 times [2022-01-10 20:03:55,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331023609] [2022-01-10 20:03:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:55,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:56,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:56,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331023609] [2022-01-10 20:03:56,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331023609] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:56,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:56,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:56,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866951899] [2022-01-10 20:03:56,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:56,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:56,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:56,045 INFO L87 Difference]: Start difference. First operand 2910 states and 3956 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:56,311 INFO L93 Difference]: Finished difference Result 5781 states and 7859 transitions. [2022-01-10 20:03:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:56,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:56,315 INFO L225 Difference]: With dead ends: 5781 [2022-01-10 20:03:56,315 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:56,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:56,318 INFO L933 BasicCegarLoop]: 2101 mSDtfsCounter, 1968 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1968 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:56,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1968 Valid, 2211 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:56,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.3486932599724897) internal successors, (3922), 2909 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3922 transitions. [2022-01-10 20:03:56,484 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3922 transitions. Word has length 154 [2022-01-10 20:03:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:56,485 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3922 transitions. [2022-01-10 20:03:56,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3922 transitions. [2022-01-10 20:03:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:56,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:56,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:56,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 20:03:56,486 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash 923674357, now seen corresponding path program 1 times [2022-01-10 20:03:56,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:56,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052216492] [2022-01-10 20:03:56,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:56,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:56,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:56,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052216492] [2022-01-10 20:03:56,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052216492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:56,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:56,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:56,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777453465] [2022-01-10 20:03:56,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:56,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:56,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:56,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:56,528 INFO L87 Difference]: Start difference. First operand 2910 states and 3922 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:56,811 INFO L93 Difference]: Finished difference Result 5780 states and 7790 transitions. [2022-01-10 20:03:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:56,815 INFO L225 Difference]: With dead ends: 5780 [2022-01-10 20:03:56,815 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:56,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:56,817 INFO L933 BasicCegarLoop]: 2082 mSDtfsCounter, 1949 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:56,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1949 Valid, 2191 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.3370013755158183) internal successors, (3888), 2909 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3888 transitions. [2022-01-10 20:03:56,983 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3888 transitions. Word has length 154 [2022-01-10 20:03:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:56,983 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3888 transitions. [2022-01-10 20:03:56,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3888 transitions. [2022-01-10 20:03:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:56,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:56,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:56,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 20:03:56,985 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash -585282156, now seen corresponding path program 1 times [2022-01-10 20:03:56,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:56,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597010652] [2022-01-10 20:03:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:56,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:57,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:57,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597010652] [2022-01-10 20:03:57,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597010652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:57,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:57,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:57,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536002715] [2022-01-10 20:03:57,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:57,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:57,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:57,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:57,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:57,024 INFO L87 Difference]: Start difference. First operand 2910 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:57,221 INFO L93 Difference]: Finished difference Result 5779 states and 7721 transitions. [2022-01-10 20:03:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:57,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:57,224 INFO L225 Difference]: With dead ends: 5779 [2022-01-10 20:03:57,224 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:57,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:57,226 INFO L933 BasicCegarLoop]: 2063 mSDtfsCounter, 1930 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:57,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1930 Valid, 2171 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.3253094910591472) internal successors, (3854), 2909 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3854 transitions. [2022-01-10 20:03:57,370 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3854 transitions. Word has length 154 [2022-01-10 20:03:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:57,371 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3854 transitions. [2022-01-10 20:03:57,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3854 transitions. [2022-01-10 20:03:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:57,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:57,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:57,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 20:03:57,372 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash 273597363, now seen corresponding path program 1 times [2022-01-10 20:03:57,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:57,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49503380] [2022-01-10 20:03:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:57,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:57,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:57,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49503380] [2022-01-10 20:03:57,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49503380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:57,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:57,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:57,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352227322] [2022-01-10 20:03:57,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:57,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:57,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:57,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:57,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:57,417 INFO L87 Difference]: Start difference. First operand 2910 states and 3854 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:57,650 INFO L93 Difference]: Finished difference Result 5778 states and 7652 transitions. [2022-01-10 20:03:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:57,654 INFO L225 Difference]: With dead ends: 5778 [2022-01-10 20:03:57,654 INFO L226 Difference]: Without dead ends: 2910 [2022-01-10 20:03:57,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:57,656 INFO L933 BasicCegarLoop]: 2044 mSDtfsCounter, 1911 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1911 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:57,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1911 Valid, 2151 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-01-10 20:03:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2022-01-10 20:03:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2908 states have (on average 1.3136176066024758) internal successors, (3820), 2909 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 3820 transitions. [2022-01-10 20:03:57,805 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 3820 transitions. Word has length 154 [2022-01-10 20:03:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:57,805 INFO L470 AbstractCegarLoop]: Abstraction has 2910 states and 3820 transitions. [2022-01-10 20:03:57,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 3820 transitions. [2022-01-10 20:03:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:57,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:57,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:57,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 20:03:57,806 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash -976009006, now seen corresponding path program 1 times [2022-01-10 20:03:57,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:57,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119464681] [2022-01-10 20:03:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:57,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:57,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:57,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119464681] [2022-01-10 20:03:57,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119464681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:57,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:57,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:03:57,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643382290] [2022-01-10 20:03:57,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:57,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:03:57,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:57,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:03:57,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:03:57,864 INFO L87 Difference]: Start difference. First operand 2910 states and 3820 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:58,303 INFO L93 Difference]: Finished difference Result 6677 states and 8846 transitions. [2022-01-10 20:03:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:03:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:58,307 INFO L225 Difference]: With dead ends: 6677 [2022-01-10 20:03:58,307 INFO L226 Difference]: Without dead ends: 3816 [2022-01-10 20:03:58,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:03:58,309 INFO L933 BasicCegarLoop]: 2209 mSDtfsCounter, 5908 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5908 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:58,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5908 Valid, 4067 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:03:58,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2022-01-10 20:03:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 2916. [2022-01-10 20:03:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2914 states have (on average 1.3040494166094716) internal successors, (3800), 2915 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3800 transitions. [2022-01-10 20:03:58,521 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3800 transitions. Word has length 154 [2022-01-10 20:03:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:58,521 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 3800 transitions. [2022-01-10 20:03:58,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3800 transitions. [2022-01-10 20:03:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:58,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:58,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:58,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 20:03:58,522 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:58,523 INFO L85 PathProgramCache]: Analyzing trace with hash 100544403, now seen corresponding path program 1 times [2022-01-10 20:03:58,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:58,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595337014] [2022-01-10 20:03:58,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:58,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:58,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:58,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595337014] [2022-01-10 20:03:58,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595337014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:58,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:58,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:03:58,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841498237] [2022-01-10 20:03:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:58,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:03:58,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:03:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:03:58,571 INFO L87 Difference]: Start difference. First operand 2916 states and 3800 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:58,999 INFO L93 Difference]: Finished difference Result 6989 states and 9171 transitions. [2022-01-10 20:03:59,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:03:59,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:59,004 INFO L225 Difference]: With dead ends: 6989 [2022-01-10 20:03:59,004 INFO L226 Difference]: Without dead ends: 4136 [2022-01-10 20:03:59,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:03:59,008 INFO L933 BasicCegarLoop]: 1990 mSDtfsCounter, 5658 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5658 SdHoareTripleChecker+Valid, 4523 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:59,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5658 Valid, 4523 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:03:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2022-01-10 20:03:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 2922. [2022-01-10 20:03:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2920 states have (on average 1.2945205479452055) internal successors, (3780), 2921 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3780 transitions. [2022-01-10 20:03:59,209 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3780 transitions. Word has length 154 [2022-01-10 20:03:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:59,209 INFO L470 AbstractCegarLoop]: Abstraction has 2922 states and 3780 transitions. [2022-01-10 20:03:59,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3780 transitions. [2022-01-10 20:03:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:59,210 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:59,210 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:59,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 20:03:59,211 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 776237012, now seen corresponding path program 1 times [2022-01-10 20:03:59,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:59,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484273889] [2022-01-10 20:03:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:59,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:59,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:59,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484273889] [2022-01-10 20:03:59,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484273889] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:59,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:59,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:03:59,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953560493] [2022-01-10 20:03:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:59,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:03:59,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:03:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:03:59,263 INFO L87 Difference]: Start difference. First operand 2922 states and 3780 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:59,754 INFO L93 Difference]: Finished difference Result 7154 states and 9305 transitions. [2022-01-10 20:03:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:03:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:03:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:59,759 INFO L225 Difference]: With dead ends: 7154 [2022-01-10 20:03:59,759 INFO L226 Difference]: Without dead ends: 4302 [2022-01-10 20:03:59,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:03:59,761 INFO L933 BasicCegarLoop]: 2053 mSDtfsCounter, 5394 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5394 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:59,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5394 Valid, 4312 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:03:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4302 states. [2022-01-10 20:03:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4302 to 2928. [2022-01-10 20:03:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2926 states have (on average 1.2850307587149692) internal successors, (3760), 2927 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:59,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3760 transitions. [2022-01-10 20:03:59,981 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3760 transitions. Word has length 154 [2022-01-10 20:03:59,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:59,982 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 3760 transitions. [2022-01-10 20:03:59,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:59,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3760 transitions. [2022-01-10 20:03:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:03:59,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:59,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:59,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-10 20:03:59,983 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:59,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash 390870229, now seen corresponding path program 1 times [2022-01-10 20:03:59,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:59,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977152038] [2022-01-10 20:03:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:59,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:00,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:00,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977152038] [2022-01-10 20:04:00,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977152038] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:00,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:00,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:00,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063296245] [2022-01-10 20:04:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:00,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:00,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:00,038 INFO L87 Difference]: Start difference. First operand 2928 states and 3760 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:00,344 INFO L93 Difference]: Finished difference Result 5831 states and 7483 transitions. [2022-01-10 20:04:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:00,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:04:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:00,347 INFO L225 Difference]: With dead ends: 5831 [2022-01-10 20:04:00,347 INFO L226 Difference]: Without dead ends: 2928 [2022-01-10 20:04:00,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:00,349 INFO L933 BasicCegarLoop]: 2011 mSDtfsCounter, 1895 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:00,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1895 Valid, 2011 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2022-01-10 20:04:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2928. [2022-01-10 20:04:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2926 states have (on average 1.2822966507177034) internal successors, (3752), 2927 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3752 transitions. [2022-01-10 20:04:00,565 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3752 transitions. Word has length 154 [2022-01-10 20:04:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:00,565 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 3752 transitions. [2022-01-10 20:04:00,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3752 transitions. [2022-01-10 20:04:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:04:00,566 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:00,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:00,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-10 20:04:00,566 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1792806698, now seen corresponding path program 1 times [2022-01-10 20:04:00,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:00,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134455343] [2022-01-10 20:04:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:00,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:00,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:00,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134455343] [2022-01-10 20:04:00,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134455343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:00,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:00,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:00,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128447437] [2022-01-10 20:04:00,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:00,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:00,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:00,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:00,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:00,614 INFO L87 Difference]: Start difference. First operand 2928 states and 3752 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:00,900 INFO L93 Difference]: Finished difference Result 5827 states and 7463 transitions. [2022-01-10 20:04:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:00,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:04:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:00,903 INFO L225 Difference]: With dead ends: 5827 [2022-01-10 20:04:00,903 INFO L226 Difference]: Without dead ends: 2928 [2022-01-10 20:04:00,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:00,905 INFO L933 BasicCegarLoop]: 2006 mSDtfsCounter, 1886 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:00,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1886 Valid, 2006 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2022-01-10 20:04:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2928. [2022-01-10 20:04:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2926 states have (on average 1.2795625427204376) internal successors, (3744), 2927 states have internal predecessors, (3744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3744 transitions. [2022-01-10 20:04:01,156 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3744 transitions. Word has length 154 [2022-01-10 20:04:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:01,156 INFO L470 AbstractCegarLoop]: Abstraction has 2928 states and 3744 transitions. [2022-01-10 20:04:01,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3744 transitions. [2022-01-10 20:04:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-10 20:04:01,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:01,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:01,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-10 20:04:01,157 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:01,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1099705001, now seen corresponding path program 1 times [2022-01-10 20:04:01,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:01,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718780497] [2022-01-10 20:04:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:01,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:01,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:01,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718780497] [2022-01-10 20:04:01,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718780497] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:01,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:01,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:01,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094199583] [2022-01-10 20:04:01,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:01,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:01,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:01,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:01,213 INFO L87 Difference]: Start difference. First operand 2928 states and 3744 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:01,776 INFO L93 Difference]: Finished difference Result 8534 states and 10922 transitions. [2022-01-10 20:04:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:01,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-01-10 20:04:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:01,782 INFO L225 Difference]: With dead ends: 8534 [2022-01-10 20:04:01,782 INFO L226 Difference]: Without dead ends: 5650 [2022-01-10 20:04:01,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:01,785 INFO L933 BasicCegarLoop]: 1993 mSDtfsCounter, 1810 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 3787 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:01,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1810 Valid, 3787 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2022-01-10 20:04:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5484. [2022-01-10 20:04:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5482 states have (on average 1.2761765778912806) internal successors, (6996), 5483 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 6996 transitions. [2022-01-10 20:04:02,403 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 6996 transitions. Word has length 154 [2022-01-10 20:04:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:02,403 INFO L470 AbstractCegarLoop]: Abstraction has 5484 states and 6996 transitions. [2022-01-10 20:04:02,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 6996 transitions. [2022-01-10 20:04:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-10 20:04:02,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:02,406 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:02,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-10 20:04:02,407 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1286510210, now seen corresponding path program 1 times [2022-01-10 20:04:02,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350825634] [2022-01-10 20:04:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:02,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:02,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:02,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350825634] [2022-01-10 20:04:02,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350825634] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:02,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:02,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:02,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414480717] [2022-01-10 20:04:02,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:02,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:02,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:02,475 INFO L87 Difference]: Start difference. First operand 5484 states and 6996 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:03,588 INFO L93 Difference]: Finished difference Result 16160 states and 20645 transitions. [2022-01-10 20:04:03,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:03,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2022-01-10 20:04:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:03,598 INFO L225 Difference]: With dead ends: 16160 [2022-01-10 20:04:03,598 INFO L226 Difference]: Without dead ends: 10726 [2022-01-10 20:04:03,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:03,604 INFO L933 BasicCegarLoop]: 1990 mSDtfsCounter, 1854 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 3784 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:03,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1854 Valid, 3784 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10726 states. [2022-01-10 20:04:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10726 to 10398. [2022-01-10 20:04:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10398 states, 10396 states have (on average 1.2743362831858407) internal successors, (13248), 10397 states have internal predecessors, (13248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10398 states to 10398 states and 13248 transitions. [2022-01-10 20:04:04,467 INFO L78 Accepts]: Start accepts. Automaton has 10398 states and 13248 transitions. Word has length 250 [2022-01-10 20:04:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:04,467 INFO L470 AbstractCegarLoop]: Abstraction has 10398 states and 13248 transitions. [2022-01-10 20:04:04,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 10398 states and 13248 transitions. [2022-01-10 20:04:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-10 20:04:04,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:04,473 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:04,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-10 20:04:04,473 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2101684863, now seen corresponding path program 1 times [2022-01-10 20:04:04,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:04,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248170846] [2022-01-10 20:04:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:04,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:04,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:04,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248170846] [2022-01-10 20:04:04,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248170846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:04,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:04,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:04:04,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153881883] [2022-01-10 20:04:04,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:04,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:04:04,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:04,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:04:04,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:04:04,557 INFO L87 Difference]: Start difference. First operand 10398 states and 13248 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:06,473 INFO L93 Difference]: Finished difference Result 28645 states and 36651 transitions. [2022-01-10 20:04:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:04:06,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2022-01-10 20:04:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:06,493 INFO L225 Difference]: With dead ends: 28645 [2022-01-10 20:04:06,493 INFO L226 Difference]: Without dead ends: 18350 [2022-01-10 20:04:06,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:04:06,504 INFO L933 BasicCegarLoop]: 2009 mSDtfsCounter, 4572 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4572 SdHoareTripleChecker+Valid, 6505 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:06,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4572 Valid, 6505 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:04:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18350 states. [2022-01-10 20:04:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18350 to 10422. [2022-01-10 20:04:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10422 states, 10420 states have (on average 1.2647792706333973) internal successors, (13179), 10421 states have internal predecessors, (13179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10422 states to 10422 states and 13179 transitions. [2022-01-10 20:04:07,525 INFO L78 Accepts]: Start accepts. Automaton has 10422 states and 13179 transitions. Word has length 250 [2022-01-10 20:04:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:07,525 INFO L470 AbstractCegarLoop]: Abstraction has 10422 states and 13179 transitions. [2022-01-10 20:04:07,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 10422 states and 13179 transitions. [2022-01-10 20:04:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-10 20:04:07,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:07,531 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:07,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-10 20:04:07,531 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 492541954, now seen corresponding path program 1 times [2022-01-10 20:04:07,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:07,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891454451] [2022-01-10 20:04:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:07,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:07,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:07,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891454451] [2022-01-10 20:04:07,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891454451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:07,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:07,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:07,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582879793] [2022-01-10 20:04:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:07,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:07,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:07,604 INFO L87 Difference]: Start difference. First operand 10422 states and 13179 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:09,608 INFO L93 Difference]: Finished difference Result 30787 states and 38757 transitions. [2022-01-10 20:04:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:09,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2022-01-10 20:04:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:09,630 INFO L225 Difference]: With dead ends: 30787 [2022-01-10 20:04:09,630 INFO L226 Difference]: Without dead ends: 20515 [2022-01-10 20:04:09,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:09,640 INFO L933 BasicCegarLoop]: 2389 mSDtfsCounter, 1825 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1825 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:09,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1825 Valid, 4347 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20515 states. [2022-01-10 20:04:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20515 to 20203. [2022-01-10 20:04:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20203 states, 20201 states have (on average 1.2543438443641404) internal successors, (25339), 20202 states have internal predecessors, (25339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20203 states to 20203 states and 25339 transitions. [2022-01-10 20:04:11,702 INFO L78 Accepts]: Start accepts. Automaton has 20203 states and 25339 transitions. Word has length 250 [2022-01-10 20:04:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:11,703 INFO L470 AbstractCegarLoop]: Abstraction has 20203 states and 25339 transitions. [2022-01-10 20:04:11,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 20203 states and 25339 transitions. [2022-01-10 20:04:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-10 20:04:11,712 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:11,712 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:11,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-10 20:04:11,712 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash -833856733, now seen corresponding path program 1 times [2022-01-10 20:04:11,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263707970] [2022-01-10 20:04:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:11,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:04:11,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:11,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263707970] [2022-01-10 20:04:11,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263707970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:11,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:11,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:11,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399629324] [2022-01-10 20:04:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:11,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:11,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:11,751 INFO L87 Difference]: Start difference. First operand 20203 states and 25339 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:13,805 INFO L93 Difference]: Finished difference Result 40209 states and 50442 transitions. [2022-01-10 20:04:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:13,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 250 [2022-01-10 20:04:13,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:13,828 INFO L225 Difference]: With dead ends: 40209 [2022-01-10 20:04:13,828 INFO L226 Difference]: Without dead ends: 20060 [2022-01-10 20:04:13,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:13,843 INFO L933 BasicCegarLoop]: 1991 mSDtfsCounter, 1986 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:13,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1986 Valid, 1992 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2022-01-10 20:04:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20060. [2022-01-10 20:04:16,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20060 states, 20058 states have (on average 1.2547611925416293) internal successors, (25168), 20059 states have internal predecessors, (25168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20060 states to 20060 states and 25168 transitions. [2022-01-10 20:04:16,031 INFO L78 Accepts]: Start accepts. Automaton has 20060 states and 25168 transitions. Word has length 250 [2022-01-10 20:04:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:16,032 INFO L470 AbstractCegarLoop]: Abstraction has 20060 states and 25168 transitions. [2022-01-10 20:04:16,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 20060 states and 25168 transitions. [2022-01-10 20:04:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-01-10 20:04:16,102 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:16,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:16,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-10 20:04:16,103 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:16,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1025049569, now seen corresponding path program 1 times [2022-01-10 20:04:16,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:16,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531094162] [2022-01-10 20:04:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:16,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:16,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531094162] [2022-01-10 20:04:16,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531094162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:16,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:16,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:16,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134743451] [2022-01-10 20:04:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:16,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:16,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:16,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:16,173 INFO L87 Difference]: Start difference. First operand 20060 states and 25168 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:19,945 INFO L93 Difference]: Finished difference Result 58302 states and 72996 transitions. [2022-01-10 20:04:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2022-01-10 20:04:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:19,992 INFO L225 Difference]: With dead ends: 58302 [2022-01-10 20:04:19,992 INFO L226 Difference]: Without dead ends: 38392 [2022-01-10 20:04:20,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:20,011 INFO L933 BasicCegarLoop]: 3198 mSDtfsCounter, 1590 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 5168 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:20,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1590 Valid, 5168 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38392 states. [2022-01-10 20:04:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38392 to 38388. [2022-01-10 20:04:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38388 states, 38386 states have (on average 1.2495180534569896) internal successors, (47964), 38387 states have internal predecessors, (47964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38388 states to 38388 states and 47964 transitions. [2022-01-10 20:04:23,912 INFO L78 Accepts]: Start accepts. Automaton has 38388 states and 47964 transitions. Word has length 251 [2022-01-10 20:04:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:23,912 INFO L470 AbstractCegarLoop]: Abstraction has 38388 states and 47964 transitions. [2022-01-10 20:04:23,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 38388 states and 47964 transitions. [2022-01-10 20:04:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-01-10 20:04:23,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:23,925 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:23,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-10 20:04:23,925 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash 854210112, now seen corresponding path program 1 times [2022-01-10 20:04:23,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:23,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705935056] [2022-01-10 20:04:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:23,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:04:23,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705935056] [2022-01-10 20:04:23,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705935056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:23,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:23,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:23,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169440768] [2022-01-10 20:04:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:23,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:23,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:23,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:23,961 INFO L87 Difference]: Start difference. First operand 38388 states and 47964 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:28,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:28,184 INFO L93 Difference]: Finished difference Result 76484 states and 95582 transitions. [2022-01-10 20:04:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:28,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 251 [2022-01-10 20:04:28,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:28,231 INFO L225 Difference]: With dead ends: 76484 [2022-01-10 20:04:28,231 INFO L226 Difference]: Without dead ends: 38246 [2022-01-10 20:04:28,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:28,251 INFO L933 BasicCegarLoop]: 1990 mSDtfsCounter, 1984 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:28,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1984 Valid, 1991 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states.