/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_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:48:30,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:48:30,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:48:30,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:48:30,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:48:30,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:48:30,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:48:30,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:48:30,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:48:30,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:48:30,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:48:30,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:48:30,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:48:30,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:48:30,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:48:30,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:48:30,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:48:30,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:48:30,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:48:30,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:48:30,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:48:30,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:48:30,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:48:30,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:48:30,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:48:30,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:48:30,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:48:30,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:48:30,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:48:30,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:48:30,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:48:30,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:48:30,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:48:30,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:48:30,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:48:30,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:48:30,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:48:30,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:48:30,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:48:30,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:48:30,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:48:30,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:48:30,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:48:30,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:48:30,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:48:30,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:48:30,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:48:30,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:48:30,990 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:48:30,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:48:30,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:48:30,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:48:30,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:48:30,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:48:30,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:48:30,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:48:30,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:48:30,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:48:30,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:48:30,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:48:30,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:48:30,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:48:30,993 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:48:30,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:48:30,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:48:30,993 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:48:30,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:48:30,994 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:48:30,994 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:48:31,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:48:31,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:48:31,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:48:31,237 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:48:31,238 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:48:31,239 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.03.cil-1.c [2022-01-11 01:48:31,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af51bd4b/34a63b3fd8354d14b516e05e9e9dc609/FLAG4af717259 [2022-01-11 01:48:31,754 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:48:31,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-1.c [2022-01-11 01:48:31,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af51bd4b/34a63b3fd8354d14b516e05e9e9dc609/FLAG4af717259 [2022-01-11 01:48:32,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af51bd4b/34a63b3fd8354d14b516e05e9e9dc609 [2022-01-11 01:48:32,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:48:32,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:48:32,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:48:32,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:48:32,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:48:32,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3b28f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32, skipping insertion in model container [2022-01-11 01:48:32,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:48:32,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:48:32,448 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.03.cil-1.c[914,927] [2022-01-11 01:48:32,489 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.03.cil-1.c[7115,7128] [2022-01-11 01:48:32,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:48:32,540 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:48:32,548 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.03.cil-1.c[914,927] [2022-01-11 01:48:32,575 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.03.cil-1.c[7115,7128] [2022-01-11 01:48:32,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:48:32,614 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:48:32,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32 WrapperNode [2022-01-11 01:48:32,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:48:32,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:48:32,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:48:32,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:48:32,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,691 INFO L137 Inliner]: procedures = 60, calls = 67, calls flagged for inlining = 62, calls inlined = 90, statements flattened = 1126 [2022-01-11 01:48:32,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:48:32,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:48:32,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:48:32,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:48:32,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:48:32,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:48:32,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:48:32,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:48:32,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (1/1) ... [2022-01-11 01:48:32,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:48:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:48:32,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:48:32,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:48:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:48:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:48:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:48:32,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:48:32,916 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:48:32,917 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:48:33,720 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:48:33,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:48:33,732 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-01-11 01:48:33,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:33 BoogieIcfgContainer [2022-01-11 01:48:33,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:48:33,745 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:48:33,745 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:48:33,747 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:48:33,749 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:33" (1/1) ... [2022-01-11 01:48:33,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:48:33 BasicIcfg [2022-01-11 01:48:33,977 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:48:33,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:48:33,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:48:33,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:48:33,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:48:32" (1/4) ... [2022-01-11 01:48:33,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f0968a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:48:33, skipping insertion in model container [2022-01-11 01:48:33,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:32" (2/4) ... [2022-01-11 01:48:33,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f0968a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:48:33, skipping insertion in model container [2022-01-11 01:48:33,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:33" (3/4) ... [2022-01-11 01:48:33,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f0968a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:48:33, skipping insertion in model container [2022-01-11 01:48:33,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:48:33" (4/4) ... [2022-01-11 01:48:33,983 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-1.cTransformedIcfg [2022-01-11 01:48:33,987 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:48:33,987 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:48:34,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:48:34,050 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:48:34,050 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:48:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 436 states, 431 states have (on average 1.5522041763341068) internal successors, (669), 435 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:34,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:34,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:34,077 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-11 01:48:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -546067027, now seen corresponding path program 1 times [2022-01-11 01:48:34,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:34,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195426509] [2022-01-11 01:48:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:34,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:34,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:34,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195426509] [2022-01-11 01:48:34,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195426509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:34,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:34,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:34,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817138905] [2022-01-11 01:48:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:34,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:34,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:34,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:34,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:34,437 INFO L87 Difference]: Start difference. First operand has 436 states, 431 states have (on average 1.5522041763341068) internal successors, (669), 435 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:34,627 INFO L93 Difference]: Finished difference Result 899 states and 1377 transitions. [2022-01-11 01:48:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:34,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:48:34,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:34,642 INFO L225 Difference]: With dead ends: 899 [2022-01-11 01:48:34,642 INFO L226 Difference]: Without dead ends: 519 [2022-01-11 01:48:34,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:34,649 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 131 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:34,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 1264 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-11 01:48:34,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 515. [2022-01-11 01:48:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 511 states have (on average 1.4892367906066537) internal successors, (761), 514 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 761 transitions. [2022-01-11 01:48:34,739 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 761 transitions. Word has length 44 [2022-01-11 01:48:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:34,740 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 761 transitions. [2022-01-11 01:48:34,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 761 transitions. [2022-01-11 01:48:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:34,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:34,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:34,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:48:34,742 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-11 01:48:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -365046899, now seen corresponding path program 1 times [2022-01-11 01:48:34,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:34,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896944902] [2022-01-11 01:48:34,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:34,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:34,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896944902] [2022-01-11 01:48:34,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896944902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:34,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:34,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:34,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872261593] [2022-01-11 01:48:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:34,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:34,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:34,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:34,862 INFO L87 Difference]: Start difference. First operand 515 states and 761 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:34,913 INFO L93 Difference]: Finished difference Result 799 states and 1165 transitions. [2022-01-11 01:48:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:48:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:34,917 INFO L225 Difference]: With dead ends: 799 [2022-01-11 01:48:34,917 INFO L226 Difference]: Without dead ends: 637 [2022-01-11 01:48:34,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:34,920 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 611 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:34,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 716 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-01-11 01:48:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 627. [2022-01-11 01:48:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 623 states have (on average 1.4735152487961476) internal successors, (918), 626 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 918 transitions. [2022-01-11 01:48:34,942 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 918 transitions. Word has length 44 [2022-01-11 01:48:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:34,943 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 918 transitions. [2022-01-11 01:48:34,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 918 transitions. [2022-01-11 01:48:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:34,945 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:34,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:34,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:48:34,945 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-11 01:48:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:34,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1673550866, now seen corresponding path program 1 times [2022-01-11 01:48:34,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:34,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82919872] [2022-01-11 01:48:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:34,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:35,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:35,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82919872] [2022-01-11 01:48:35,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82919872] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:35,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:35,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:35,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973339824] [2022-01-11 01:48:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:35,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:35,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:35,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,034 INFO L87 Difference]: Start difference. First operand 627 states and 918 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:35,140 INFO L93 Difference]: Finished difference Result 1038 states and 1495 transitions. [2022-01-11 01:48:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:48:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:35,145 INFO L225 Difference]: With dead ends: 1038 [2022-01-11 01:48:35,146 INFO L226 Difference]: Without dead ends: 776 [2022-01-11 01:48:35,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,159 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 102 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:35,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 1225 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-01-11 01:48:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 772. [2022-01-11 01:48:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 768 states have (on average 1.4505208333333333) internal successors, (1114), 771 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1114 transitions. [2022-01-11 01:48:35,193 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1114 transitions. Word has length 44 [2022-01-11 01:48:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:35,193 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 1114 transitions. [2022-01-11 01:48:35,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1114 transitions. [2022-01-11 01:48:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:35,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:35,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:35,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:48:35,201 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-11 01:48:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:35,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2082375091, now seen corresponding path program 1 times [2022-01-11 01:48:35,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:35,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141387429] [2022-01-11 01:48:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:35,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:35,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:35,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141387429] [2022-01-11 01:48:35,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141387429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:35,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:35,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:35,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760339708] [2022-01-11 01:48:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:35,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:35,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:35,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:35,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,273 INFO L87 Difference]: Start difference. First operand 772 states and 1114 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:35,326 INFO L93 Difference]: Finished difference Result 1524 states and 2162 transitions. [2022-01-11 01:48:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:35,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:48:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:35,331 INFO L225 Difference]: With dead ends: 1524 [2022-01-11 01:48:35,331 INFO L226 Difference]: Without dead ends: 1160 [2022-01-11 01:48:35,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,338 INFO L933 BasicCegarLoop]: 627 mSDtfsCounter, 590 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:35,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 742 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-01-11 01:48:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1156. [2022-01-11 01:48:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1152 states have (on average 1.4114583333333333) internal successors, (1626), 1155 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1626 transitions. [2022-01-11 01:48:35,419 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1626 transitions. Word has length 44 [2022-01-11 01:48:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:35,421 INFO L470 AbstractCegarLoop]: Abstraction has 1156 states and 1626 transitions. [2022-01-11 01:48:35,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1626 transitions. [2022-01-11 01:48:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:48:35,422 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:35,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:35,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:48:35,423 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-11 01:48:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash 181105350, now seen corresponding path program 1 times [2022-01-11 01:48:35,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002035365] [2022-01-11 01:48:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:35,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:35,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002035365] [2022-01-11 01:48:35,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002035365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:35,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:35,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:35,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804587814] [2022-01-11 01:48:35,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:35,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:35,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:35,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,486 INFO L87 Difference]: Start difference. First operand 1156 states and 1626 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:35,559 INFO L93 Difference]: Finished difference Result 2099 states and 2922 transitions. [2022-01-11 01:48:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:35,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 01:48:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:35,566 INFO L225 Difference]: With dead ends: 2099 [2022-01-11 01:48:35,566 INFO L226 Difference]: Without dead ends: 1319 [2022-01-11 01:48:35,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,568 INFO L933 BasicCegarLoop]: 628 mSDtfsCounter, 88 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:35,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 1197 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-01-11 01:48:35,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1296. [2022-01-11 01:48:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1292 states have (on average 1.388544891640867) internal successors, (1794), 1295 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1794 transitions. [2022-01-11 01:48:35,624 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1794 transitions. Word has length 45 [2022-01-11 01:48:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:35,627 INFO L470 AbstractCegarLoop]: Abstraction has 1296 states and 1794 transitions. [2022-01-11 01:48:35,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1794 transitions. [2022-01-11 01:48:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:48:35,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:35,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] [2022-01-11 01:48:35,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:48:35,634 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-11 01:48:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash 210687813, now seen corresponding path program 1 times [2022-01-11 01:48:35,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:35,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552107225] [2022-01-11 01:48:35,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:35,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:35,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552107225] [2022-01-11 01:48:35,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552107225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:35,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:35,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:35,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154044093] [2022-01-11 01:48:35,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:35,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:35,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:35,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:35,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,717 INFO L87 Difference]: Start difference. First operand 1296 states and 1794 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:35,795 INFO L93 Difference]: Finished difference Result 2925 states and 3995 transitions. [2022-01-11 01:48:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 01:48:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:35,804 INFO L225 Difference]: With dead ends: 2925 [2022-01-11 01:48:35,804 INFO L226 Difference]: Without dead ends: 2015 [2022-01-11 01:48:35,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:35,807 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 576 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:35,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 709 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-01-11 01:48:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1961. [2022-01-11 01:48:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1957 states have (on average 1.3622892181911088) internal successors, (2666), 1960 states have internal predecessors, (2666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2666 transitions. [2022-01-11 01:48:35,887 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2666 transitions. Word has length 45 [2022-01-11 01:48:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:35,889 INFO L470 AbstractCegarLoop]: Abstraction has 1961 states and 2666 transitions. [2022-01-11 01:48:35,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2666 transitions. [2022-01-11 01:48:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:35,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:35,890 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:35,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:48:35,891 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-11 01:48:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1751002510, now seen corresponding path program 1 times [2022-01-11 01:48:35,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:35,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240634678] [2022-01-11 01:48:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:35,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:35,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:35,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240634678] [2022-01-11 01:48:35,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240634678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:35,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:35,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:35,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333998838] [2022-01-11 01:48:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:35,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:35,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:35,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:35,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:35,990 INFO L87 Difference]: Start difference. First operand 1961 states and 2666 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:36,188 INFO L93 Difference]: Finished difference Result 4672 states and 6324 transitions. [2022-01-11 01:48:36,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:36,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 01:48:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:36,202 INFO L225 Difference]: With dead ends: 4672 [2022-01-11 01:48:36,202 INFO L226 Difference]: Without dead ends: 3303 [2022-01-11 01:48:36,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:36,207 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 390 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:36,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 2580 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2022-01-11 01:48:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2009. [2022-01-11 01:48:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 2005 states have (on average 1.344638403990025) internal successors, (2696), 2008 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2696 transitions. [2022-01-11 01:48:36,339 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2696 transitions. Word has length 52 [2022-01-11 01:48:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:36,339 INFO L470 AbstractCegarLoop]: Abstraction has 2009 states and 2696 transitions. [2022-01-11 01:48:36,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2696 transitions. [2022-01-11 01:48:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:36,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:36,340 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:36,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:48:36,341 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-11 01:48:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash 199297745, now seen corresponding path program 1 times [2022-01-11 01:48:36,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:36,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60720649] [2022-01-11 01:48:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:36,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:36,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60720649] [2022-01-11 01:48:36,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60720649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:36,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:36,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:36,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859129954] [2022-01-11 01:48:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:36,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:36,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:36,400 INFO L87 Difference]: Start difference. First operand 2009 states and 2696 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:36,607 INFO L93 Difference]: Finished difference Result 4372 states and 5853 transitions. [2022-01-11 01:48:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:36,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 01:48:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:36,618 INFO L225 Difference]: With dead ends: 4372 [2022-01-11 01:48:36,618 INFO L226 Difference]: Without dead ends: 2765 [2022-01-11 01:48:36,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:36,621 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 351 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:36,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 2592 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2022-01-11 01:48:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 2021. [2022-01-11 01:48:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2017 states have (on average 1.3277144273673773) internal successors, (2678), 2020 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2678 transitions. [2022-01-11 01:48:36,765 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2678 transitions. Word has length 52 [2022-01-11 01:48:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:36,766 INFO L470 AbstractCegarLoop]: Abstraction has 2021 states and 2678 transitions. [2022-01-11 01:48:36,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2678 transitions. [2022-01-11 01:48:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:36,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:36,767 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:36,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:48:36,767 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-11 01:48:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash 210613872, now seen corresponding path program 1 times [2022-01-11 01:48:36,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:36,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573904120] [2022-01-11 01:48:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:36,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:36,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:36,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573904120] [2022-01-11 01:48:36,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573904120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:36,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:36,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:48:36,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323936521] [2022-01-11 01:48:36,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:36,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:48:36,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:48:36,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:48:36,876 INFO L87 Difference]: Start difference. First operand 2021 states and 2678 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:37,058 INFO L93 Difference]: Finished difference Result 2371 states and 3130 transitions. [2022-01-11 01:48:37,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:48:37,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 01:48:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:37,068 INFO L225 Difference]: With dead ends: 2371 [2022-01-11 01:48:37,068 INFO L226 Difference]: Without dead ends: 2369 [2022-01-11 01:48:37,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:37,071 INFO L933 BasicCegarLoop]: 628 mSDtfsCounter, 1287 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:37,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1287 Valid, 716 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-01-11 01:48:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2019. [2022-01-11 01:48:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2016 states have (on average 1.3229166666666667) internal successors, (2667), 2018 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2667 transitions. [2022-01-11 01:48:37,244 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2667 transitions. Word has length 52 [2022-01-11 01:48:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:37,245 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 2667 transitions. [2022-01-11 01:48:37,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2667 transitions. [2022-01-11 01:48:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 01:48:37,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:37,246 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:37,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 01:48:37,246 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-11 01:48:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2060903647, now seen corresponding path program 1 times [2022-01-11 01:48:37,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:37,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369348251] [2022-01-11 01:48:37,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:37,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:37,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369348251] [2022-01-11 01:48:37,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369348251] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:48:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555501432] [2022-01-11 01:48:37,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:37,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:48:37,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:48:37,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:48:37,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:48:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:37,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:48:37,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:48:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:37,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:48:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:38,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555501432] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:48:38,277 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:48:38,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:48:38,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439896192] [2022-01-11 01:48:38,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:48:38,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:48:38,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:48:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:48:38,278 INFO L87 Difference]: Start difference. First operand 2019 states and 2667 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:39,133 INFO L93 Difference]: Finished difference Result 5512 states and 7253 transitions. [2022-01-11 01:48:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:48:39,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-01-11 01:48:39,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:39,152 INFO L225 Difference]: With dead ends: 5512 [2022-01-11 01:48:39,152 INFO L226 Difference]: Without dead ends: 5510 [2022-01-11 01:48:39,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:48:39,153 INFO L933 BasicCegarLoop]: 771 mSDtfsCounter, 2271 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:39,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2271 Valid, 3294 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:39,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2022-01-11 01:48:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 3540. [2022-01-11 01:48:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 3537 states have (on average 1.317500706813684) internal successors, (4660), 3539 states have internal predecessors, (4660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4660 transitions. [2022-01-11 01:48:39,543 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4660 transitions. Word has length 53 [2022-01-11 01:48:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:39,543 INFO L470 AbstractCegarLoop]: Abstraction has 3540 states and 4660 transitions. [2022-01-11 01:48:39,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4660 transitions. [2022-01-11 01:48:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:48:39,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:39,545 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:39,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 01:48:39,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-11 01:48:39,760 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-11 01:48:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash 678881442, now seen corresponding path program 2 times [2022-01-11 01:48:39,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:39,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983030229] [2022-01-11 01:48:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:39,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:39,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:39,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983030229] [2022-01-11 01:48:39,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983030229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:39,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:39,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:39,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974348560] [2022-01-11 01:48:39,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:39,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:39,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:39,801 INFO L87 Difference]: Start difference. First operand 3540 states and 4660 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:40,074 INFO L93 Difference]: Finished difference Result 5178 states and 6825 transitions. [2022-01-11 01:48:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 01:48:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:40,084 INFO L225 Difference]: With dead ends: 5178 [2022-01-11 01:48:40,084 INFO L226 Difference]: Without dead ends: 2450 [2022-01-11 01:48:40,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:40,088 INFO L933 BasicCegarLoop]: 683 mSDtfsCounter, 572 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:40,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 797 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2022-01-11 01:48:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2422. [2022-01-11 01:48:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2419 states have (on average 1.3046713517982638) internal successors, (3156), 2421 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 3156 transitions. [2022-01-11 01:48:40,325 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 3156 transitions. Word has length 56 [2022-01-11 01:48:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:40,326 INFO L470 AbstractCegarLoop]: Abstraction has 2422 states and 3156 transitions. [2022-01-11 01:48:40,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 3156 transitions. [2022-01-11 01:48:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 01:48:40,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:40,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:40,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:48:40,328 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-11 01:48:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash 463734239, now seen corresponding path program 1 times [2022-01-11 01:48:40,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:40,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870702097] [2022-01-11 01:48:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:40,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:40,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870702097] [2022-01-11 01:48:40,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870702097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:40,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:40,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:40,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466661414] [2022-01-11 01:48:40,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:40,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:40,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:40,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:40,370 INFO L87 Difference]: Start difference. First operand 2422 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:40,699 INFO L93 Difference]: Finished difference Result 5801 states and 7436 transitions. [2022-01-11 01:48:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-11 01:48:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:40,718 INFO L225 Difference]: With dead ends: 5801 [2022-01-11 01:48:40,718 INFO L226 Difference]: Without dead ends: 2988 [2022-01-11 01:48:40,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:40,723 INFO L933 BasicCegarLoop]: 708 mSDtfsCounter, 87 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:40,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 1314 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2022-01-11 01:48:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2988. [2022-01-11 01:48:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2988 states, 2985 states have (on average 1.283752093802345) internal successors, (3832), 2987 states have internal predecessors, (3832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 3832 transitions. [2022-01-11 01:48:40,987 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 3832 transitions. Word has length 60 [2022-01-11 01:48:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:40,988 INFO L470 AbstractCegarLoop]: Abstraction has 2988 states and 3832 transitions. [2022-01-11 01:48:40,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 3832 transitions. [2022-01-11 01:48:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:40,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:40,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] [2022-01-11 01:48:40,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:48:40,994 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1052078073, now seen corresponding path program 1 times [2022-01-11 01:48:40,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:40,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780094523] [2022-01-11 01:48:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:40,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:41,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:41,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780094523] [2022-01-11 01:48:41,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780094523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:41,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:41,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:41,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282208466] [2022-01-11 01:48:41,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:41,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:41,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:41,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:41,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:41,027 INFO L87 Difference]: Start difference. First operand 2988 states and 3832 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:41,284 INFO L93 Difference]: Finished difference Result 3547 states and 4667 transitions. [2022-01-11 01:48:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:41,298 INFO L225 Difference]: With dead ends: 3547 [2022-01-11 01:48:41,298 INFO L226 Difference]: Without dead ends: 3230 [2022-01-11 01:48:41,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:41,301 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 560 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:41,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 1008 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2022-01-11 01:48:41,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3226. [2022-01-11 01:48:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.2987899472541111) internal successors, (4186), 3225 states have internal predecessors, (4186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4186 transitions. [2022-01-11 01:48:41,591 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4186 transitions. Word has length 66 [2022-01-11 01:48:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:41,592 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4186 transitions. [2022-01-11 01:48:41,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4186 transitions. [2022-01-11 01:48:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:41,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:41,594 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] [2022-01-11 01:48:41,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:48:41,594 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 213023783, now seen corresponding path program 1 times [2022-01-11 01:48:41,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:41,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167121307] [2022-01-11 01:48:41,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:41,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:41,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-11 01:48:41,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:41,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167121307] [2022-01-11 01:48:41,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167121307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:41,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:41,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:41,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63349327] [2022-01-11 01:48:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:41,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:41,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:41,620 INFO L87 Difference]: Start difference. First operand 3226 states and 4186 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:41,958 INFO L93 Difference]: Finished difference Result 3780 states and 5014 transitions. [2022-01-11 01:48:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:41,964 INFO L225 Difference]: With dead ends: 3780 [2022-01-11 01:48:41,965 INFO L226 Difference]: Without dead ends: 3226 [2022-01-11 01:48:41,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:41,967 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 600 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:41,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 606 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-01-11 01:48:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2022-01-11 01:48:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.2963077877753646) internal successors, (4178), 3225 states have internal predecessors, (4178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4178 transitions. [2022-01-11 01:48:42,282 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4178 transitions. Word has length 66 [2022-01-11 01:48:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:42,282 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4178 transitions. [2022-01-11 01:48:42,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4178 transitions. [2022-01-11 01:48:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:42,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:42,285 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] [2022-01-11 01:48:42,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:48:42,286 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:42,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1131639801, now seen corresponding path program 1 times [2022-01-11 01:48:42,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:42,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270157630] [2022-01-11 01:48:42,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:42,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:42,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270157630] [2022-01-11 01:48:42,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270157630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:42,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:42,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:42,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614318229] [2022-01-11 01:48:42,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:42,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:42,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:42,319 INFO L87 Difference]: Start difference. First operand 3226 states and 4178 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:42,573 INFO L93 Difference]: Finished difference Result 3779 states and 4997 transitions. [2022-01-11 01:48:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:42,579 INFO L225 Difference]: With dead ends: 3779 [2022-01-11 01:48:42,579 INFO L226 Difference]: Without dead ends: 3226 [2022-01-11 01:48:42,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:42,583 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:42,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 601 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-01-11 01:48:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2022-01-11 01:48:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.293825628296618) internal successors, (4170), 3225 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4170 transitions. [2022-01-11 01:48:42,870 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4170 transitions. Word has length 66 [2022-01-11 01:48:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:42,870 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4170 transitions. [2022-01-11 01:48:42,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4170 transitions. [2022-01-11 01:48:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:42,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:42,872 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] [2022-01-11 01:48:42,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:48:42,872 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:42,873 INFO L85 PathProgramCache]: Analyzing trace with hash -482279385, now seen corresponding path program 1 times [2022-01-11 01:48:42,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:42,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950332273] [2022-01-11 01:48:42,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:42,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:42,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:42,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950332273] [2022-01-11 01:48:42,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950332273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:42,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:42,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:42,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952083578] [2022-01-11 01:48:42,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:42,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:42,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:42,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:42,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:42,901 INFO L87 Difference]: Start difference. First operand 3226 states and 4170 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:43,179 INFO L93 Difference]: Finished difference Result 3778 states and 4980 transitions. [2022-01-11 01:48:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:43,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:43,185 INFO L225 Difference]: With dead ends: 3778 [2022-01-11 01:48:43,185 INFO L226 Difference]: Without dead ends: 3226 [2022-01-11 01:48:43,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:43,187 INFO L933 BasicCegarLoop]: 596 mSDtfsCounter, 588 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:43,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 596 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-01-11 01:48:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2022-01-11 01:48:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.2913434688178715) internal successors, (4162), 3225 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4162 transitions. [2022-01-11 01:48:43,480 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4162 transitions. Word has length 66 [2022-01-11 01:48:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:43,481 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4162 transitions. [2022-01-11 01:48:43,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4162 transitions. [2022-01-11 01:48:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:43,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:43,483 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] [2022-01-11 01:48:43,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:48:43,483 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1478330375, now seen corresponding path program 1 times [2022-01-11 01:48:43,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:43,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832123245] [2022-01-11 01:48:43,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:43,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:43,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:43,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832123245] [2022-01-11 01:48:43,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832123245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:43,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:43,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:43,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439722650] [2022-01-11 01:48:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:43,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:43,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:43,515 INFO L87 Difference]: Start difference. First operand 3226 states and 4162 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:43,877 INFO L93 Difference]: Finished difference Result 3777 states and 4963 transitions. [2022-01-11 01:48:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:43,883 INFO L225 Difference]: With dead ends: 3777 [2022-01-11 01:48:43,883 INFO L226 Difference]: Without dead ends: 3226 [2022-01-11 01:48:43,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:43,885 INFO L933 BasicCegarLoop]: 579 mSDtfsCounter, 534 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:43,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 617 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-01-11 01:48:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2022-01-11 01:48:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.285758609990692) internal successors, (4144), 3225 states have internal predecessors, (4144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4144 transitions. [2022-01-11 01:48:44,193 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4144 transitions. Word has length 66 [2022-01-11 01:48:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:44,193 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4144 transitions. [2022-01-11 01:48:44,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4144 transitions. [2022-01-11 01:48:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:44,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:44,195 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] [2022-01-11 01:48:44,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:48:44,195 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1851745253, now seen corresponding path program 1 times [2022-01-11 01:48:44,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:44,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811779548] [2022-01-11 01:48:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:44,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:44,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:44,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811779548] [2022-01-11 01:48:44,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811779548] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:44,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:44,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:44,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31223195] [2022-01-11 01:48:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:44,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:44,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:44,221 INFO L87 Difference]: Start difference. First operand 3226 states and 4144 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:44,511 INFO L93 Difference]: Finished difference Result 3776 states and 4926 transitions. [2022-01-11 01:48:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:44,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:44,516 INFO L225 Difference]: With dead ends: 3776 [2022-01-11 01:48:44,516 INFO L226 Difference]: Without dead ends: 3226 [2022-01-11 01:48:44,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:44,518 INFO L933 BasicCegarLoop]: 568 mSDtfsCounter, 523 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:44,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 605 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-01-11 01:48:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2022-01-11 01:48:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.2801737511635123) internal successors, (4126), 3225 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-11 01:48:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4126 transitions. [2022-01-11 01:48:44,747 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4126 transitions. Word has length 66 [2022-01-11 01:48:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:44,748 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4126 transitions. [2022-01-11 01:48:44,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4126 transitions. [2022-01-11 01:48:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:44,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:44,749 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] [2022-01-11 01:48:44,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:48:44,750 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1319604092, now seen corresponding path program 1 times [2022-01-11 01:48:44,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:44,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038469169] [2022-01-11 01:48:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:44,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:44,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:44,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038469169] [2022-01-11 01:48:44,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038469169] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:44,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:44,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:44,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711257332] [2022-01-11 01:48:44,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:44,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:44,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:44,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:44,778 INFO L87 Difference]: Start difference. First operand 3226 states and 4126 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:45,079 INFO L93 Difference]: Finished difference Result 3775 states and 4889 transitions. [2022-01-11 01:48:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:45,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:45,085 INFO L225 Difference]: With dead ends: 3775 [2022-01-11 01:48:45,085 INFO L226 Difference]: Without dead ends: 3226 [2022-01-11 01:48:45,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:45,087 INFO L933 BasicCegarLoop]: 557 mSDtfsCounter, 512 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:45,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 593 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:45,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-01-11 01:48:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2022-01-11 01:48:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.2745888923363327) internal successors, (4108), 3225 states have internal predecessors, (4108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4108 transitions. [2022-01-11 01:48:45,326 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4108 transitions. Word has length 66 [2022-01-11 01:48:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:45,327 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4108 transitions. [2022-01-11 01:48:45,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4108 transitions. [2022-01-11 01:48:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:45,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:45,329 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] [2022-01-11 01:48:45,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:48:45,329 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-11 01:48:45,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -725336925, now seen corresponding path program 1 times [2022-01-11 01:48:45,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:45,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879634159] [2022-01-11 01:48:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:45,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:45,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:45,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879634159] [2022-01-11 01:48:45,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879634159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:45,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:45,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:45,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039111284] [2022-01-11 01:48:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:45,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:45,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:45,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:45,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:45,354 INFO L87 Difference]: Start difference. First operand 3226 states and 4108 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:45,636 INFO L93 Difference]: Finished difference Result 3774 states and 4852 transitions. [2022-01-11 01:48:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:45,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:45,642 INFO L225 Difference]: With dead ends: 3774 [2022-01-11 01:48:45,642 INFO L226 Difference]: Without dead ends: 3226 [2022-01-11 01:48:45,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:45,644 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 501 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:45,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 581 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2022-01-11 01:48:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2022-01-11 01:48:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3223 states have (on average 1.269004033509153) internal successors, (4090), 3225 states have internal predecessors, (4090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4090 transitions. [2022-01-11 01:48:45,920 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4090 transitions. Word has length 66 [2022-01-11 01:48:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:45,920 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4090 transitions. [2022-01-11 01:48:45,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4090 transitions. [2022-01-11 01:48:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:45,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:45,922 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] [2022-01-11 01:48:45,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:48:45,922 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-11 01:48:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1243630461, now seen corresponding path program 1 times [2022-01-11 01:48:45,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:45,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974184967] [2022-01-11 01:48:45,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:45,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:45,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:45,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974184967] [2022-01-11 01:48:45,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974184967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:45,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:45,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:45,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744086354] [2022-01-11 01:48:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:45,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:45,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:45,965 INFO L87 Difference]: Start difference. First operand 3226 states and 4090 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:46,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:46,382 INFO L93 Difference]: Finished difference Result 4097 states and 5270 transitions. [2022-01-11 01:48:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:46,388 INFO L225 Difference]: With dead ends: 4097 [2022-01-11 01:48:46,388 INFO L226 Difference]: Without dead ends: 3556 [2022-01-11 01:48:46,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:46,390 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 1154 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:46,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1154 Valid, 1673 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2022-01-11 01:48:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3232. [2022-01-11 01:48:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 3229 states have (on average 1.2654072468256425) internal successors, (4086), 3231 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4086 transitions. [2022-01-11 01:48:46,666 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4086 transitions. Word has length 66 [2022-01-11 01:48:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:46,666 INFO L470 AbstractCegarLoop]: Abstraction has 3232 states and 4086 transitions. [2022-01-11 01:48:46,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4086 transitions. [2022-01-11 01:48:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:46,668 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:46,668 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] [2022-01-11 01:48:46,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:48:46,668 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-11 01:48:46,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1692327100, now seen corresponding path program 1 times [2022-01-11 01:48:46,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:46,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460594412] [2022-01-11 01:48:46,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:46,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:46,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:46,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460594412] [2022-01-11 01:48:46,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460594412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:46,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:46,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:46,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519458077] [2022-01-11 01:48:46,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:46,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:46,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:46,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:46,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:46,707 INFO L87 Difference]: Start difference. First operand 3232 states and 4086 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:47,090 INFO L93 Difference]: Finished difference Result 4220 states and 5402 transitions. [2022-01-11 01:48:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:47,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:47,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:47,097 INFO L225 Difference]: With dead ends: 4220 [2022-01-11 01:48:47,097 INFO L226 Difference]: Without dead ends: 3694 [2022-01-11 01:48:47,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:47,100 INFO L933 BasicCegarLoop]: 531 mSDtfsCounter, 898 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:47,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [898 Valid, 1994 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2022-01-11 01:48:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3238. [2022-01-11 01:48:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 3235 states have (on average 1.261823802163833) internal successors, (4082), 3237 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4082 transitions. [2022-01-11 01:48:47,383 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4082 transitions. Word has length 66 [2022-01-11 01:48:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:47,383 INFO L470 AbstractCegarLoop]: Abstraction has 3238 states and 4082 transitions. [2022-01-11 01:48:47,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4082 transitions. [2022-01-11 01:48:47,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:48:47,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:47,385 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] [2022-01-11 01:48:47,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:48:47,386 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-11 01:48:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 525430853, now seen corresponding path program 1 times [2022-01-11 01:48:47,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798455712] [2022-01-11 01:48:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:47,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:47,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-11 01:48:47,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:47,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798455712] [2022-01-11 01:48:47,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798455712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:47,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:47,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:47,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311448264] [2022-01-11 01:48:47,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:47,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:47,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:47,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:47,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:47,416 INFO L87 Difference]: Start difference. First operand 3238 states and 4082 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:47,773 INFO L93 Difference]: Finished difference Result 4280 states and 5419 transitions. [2022-01-11 01:48:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 01:48:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:47,779 INFO L225 Difference]: With dead ends: 4280 [2022-01-11 01:48:47,779 INFO L226 Difference]: Without dead ends: 3722 [2022-01-11 01:48:47,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:47,783 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 448 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:47,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 870 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2022-01-11 01:48:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3668. [2022-01-11 01:48:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 3665 states have (on average 1.2613915416098227) internal successors, (4623), 3667 states have internal predecessors, (4623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4623 transitions. [2022-01-11 01:48:48,020 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4623 transitions. Word has length 66 [2022-01-11 01:48:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:48,021 INFO L470 AbstractCegarLoop]: Abstraction has 3668 states and 4623 transitions. [2022-01-11 01:48:48,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4623 transitions. [2022-01-11 01:48:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 01:48:48,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:48,023 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:48,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:48:48,023 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 547661498, now seen corresponding path program 1 times [2022-01-11 01:48:48,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:48,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616626721] [2022-01-11 01:48:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:48,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:48,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:48,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616626721] [2022-01-11 01:48:48,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616626721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:48,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:48,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:48,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032203339] [2022-01-11 01:48:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:48,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:48,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:48,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:48,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:48,054 INFO L87 Difference]: Start difference. First operand 3668 states and 4623 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:48,410 INFO L93 Difference]: Finished difference Result 6238 states and 7866 transitions. [2022-01-11 01:48:48,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:48,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 01:48:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:48,416 INFO L225 Difference]: With dead ends: 6238 [2022-01-11 01:48:48,416 INFO L226 Difference]: Without dead ends: 3668 [2022-01-11 01:48:48,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:48,419 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 487 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:48,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 628 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:48,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2022-01-11 01:48:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3668. [2022-01-11 01:48:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 3665 states have (on average 1.246111869031378) internal successors, (4567), 3667 states have internal predecessors, (4567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4567 transitions. [2022-01-11 01:48:48,746 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4567 transitions. Word has length 68 [2022-01-11 01:48:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:48,746 INFO L470 AbstractCegarLoop]: Abstraction has 3668 states and 4567 transitions. [2022-01-11 01:48:48,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:48,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4567 transitions. [2022-01-11 01:48:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 01:48:48,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:48,748 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:48,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:48:48,749 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:48,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1193919387, now seen corresponding path program 1 times [2022-01-11 01:48:48,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:48,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100681596] [2022-01-11 01:48:48,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:48,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:48,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:48,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100681596] [2022-01-11 01:48:48,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100681596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:48,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:48,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:48,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123330816] [2022-01-11 01:48:48,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:48,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:48,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:48,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:48,780 INFO L87 Difference]: Start difference. First operand 3668 states and 4567 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:49,144 INFO L93 Difference]: Finished difference Result 5732 states and 7157 transitions. [2022-01-11 01:48:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:49,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 01:48:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:49,149 INFO L225 Difference]: With dead ends: 5732 [2022-01-11 01:48:49,150 INFO L226 Difference]: Without dead ends: 3122 [2022-01-11 01:48:49,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:49,153 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 97 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:49,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2022-01-11 01:48:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3120. [2022-01-11 01:48:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 3117 states have (on average 1.2409367982034007) internal successors, (3868), 3119 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 3868 transitions. [2022-01-11 01:48:49,391 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 3868 transitions. Word has length 69 [2022-01-11 01:48:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:49,391 INFO L470 AbstractCegarLoop]: Abstraction has 3120 states and 3868 transitions. [2022-01-11 01:48:49,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 3868 transitions. [2022-01-11 01:48:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 01:48:49,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:49,394 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] [2022-01-11 01:48:49,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:48:49,395 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-11 01:48:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:49,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1136530323, now seen corresponding path program 1 times [2022-01-11 01:48:49,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:49,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062482572] [2022-01-11 01:48:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:49,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:49,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:49,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062482572] [2022-01-11 01:48:49,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062482572] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:49,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:49,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:49,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689826659] [2022-01-11 01:48:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:49,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:49,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:49,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:49,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:49,431 INFO L87 Difference]: Start difference. First operand 3120 states and 3868 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:49,768 INFO L93 Difference]: Finished difference Result 4996 states and 6270 transitions. [2022-01-11 01:48:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-01-11 01:48:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:49,775 INFO L225 Difference]: With dead ends: 4996 [2022-01-11 01:48:49,775 INFO L226 Difference]: Without dead ends: 4014 [2022-01-11 01:48:49,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:49,777 INFO L933 BasicCegarLoop]: 531 mSDtfsCounter, 467 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:49,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 866 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2022-01-11 01:48:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 3922. [2022-01-11 01:48:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3919 states have (on average 1.2472569533044144) internal successors, (4888), 3921 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 4888 transitions. [2022-01-11 01:48:50,087 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 4888 transitions. Word has length 106 [2022-01-11 01:48:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:50,087 INFO L470 AbstractCegarLoop]: Abstraction has 3922 states and 4888 transitions. [2022-01-11 01:48:50,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 4888 transitions. [2022-01-11 01:48:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 01:48:50,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:50,091 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] [2022-01-11 01:48:50,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:48:50,091 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-11 01:48:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash 618027922, now seen corresponding path program 1 times [2022-01-11 01:48:50,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:50,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778897620] [2022-01-11 01:48:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:50,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:50,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:50,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778897620] [2022-01-11 01:48:50,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778897620] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:50,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:50,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:50,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246275737] [2022-01-11 01:48:50,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:50,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:50,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:50,125 INFO L87 Difference]: Start difference. First operand 3922 states and 4888 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:50,494 INFO L93 Difference]: Finished difference Result 7351 states and 9213 transitions. [2022-01-11 01:48:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:50,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-01-11 01:48:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:50,501 INFO L225 Difference]: With dead ends: 7351 [2022-01-11 01:48:50,501 INFO L226 Difference]: Without dead ends: 5595 [2022-01-11 01:48:50,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:50,504 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 476 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:50,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [476 Valid, 1013 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5595 states. [2022-01-11 01:48:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5595 to 5519. [2022-01-11 01:48:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5519 states, 5516 states have (on average 1.2420232052211748) internal successors, (6851), 5518 states have internal predecessors, (6851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 6851 transitions. [2022-01-11 01:48:50,988 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 6851 transitions. Word has length 106 [2022-01-11 01:48:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:50,988 INFO L470 AbstractCegarLoop]: Abstraction has 5519 states and 6851 transitions. [2022-01-11 01:48:50,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 6851 transitions. [2022-01-11 01:48:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 01:48:50,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:50,992 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] [2022-01-11 01:48:50,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:48:50,992 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-11 01:48:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -216374605, now seen corresponding path program 1 times [2022-01-11 01:48:50,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910807722] [2022-01-11 01:48:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:50,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:51,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:48:51,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:51,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910807722] [2022-01-11 01:48:51,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910807722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:51,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:51,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:51,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306906406] [2022-01-11 01:48:51,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:51,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:51,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:51,018 INFO L87 Difference]: Start difference. First operand 5519 states and 6851 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:51,394 INFO L93 Difference]: Finished difference Result 8849 states and 11028 transitions. [2022-01-11 01:48:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-11 01:48:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:51,399 INFO L225 Difference]: With dead ends: 8849 [2022-01-11 01:48:51,399 INFO L226 Difference]: Without dead ends: 5472 [2022-01-11 01:48:51,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:51,403 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 407 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:51,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 665 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2022-01-11 01:48:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5472. [2022-01-11 01:48:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5472 states, 5469 states have (on average 1.2428231852258182) internal successors, (6797), 5471 states have internal predecessors, (6797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 6797 transitions. [2022-01-11 01:48:51,840 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 6797 transitions. Word has length 106 [2022-01-11 01:48:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:51,840 INFO L470 AbstractCegarLoop]: Abstraction has 5472 states and 6797 transitions. [2022-01-11 01:48:51,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 6797 transitions. [2022-01-11 01:48:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 01:48:51,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:51,843 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] [2022-01-11 01:48:51,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:48:51,843 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-11 01:48:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash -734348317, now seen corresponding path program 1 times [2022-01-11 01:48:51,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:51,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435023592] [2022-01-11 01:48:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:51,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:51,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:51,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435023592] [2022-01-11 01:48:51,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435023592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:51,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:51,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:51,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179451698] [2022-01-11 01:48:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:51,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:51,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:51,885 INFO L87 Difference]: Start difference. First operand 5472 states and 6797 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:52,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:52,496 INFO L93 Difference]: Finished difference Result 11722 states and 14604 transitions. [2022-01-11 01:48:52,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:52,497 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 107 [2022-01-11 01:48:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:52,505 INFO L225 Difference]: With dead ends: 11722 [2022-01-11 01:48:52,505 INFO L226 Difference]: Without dead ends: 8416 [2022-01-11 01:48:52,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:52,509 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 475 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:52,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 1018 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2022-01-11 01:48:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 8188. [2022-01-11 01:48:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8188 states, 8185 states have (on average 1.2388515577275503) internal successors, (10140), 8187 states have internal predecessors, (10140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8188 states to 8188 states and 10140 transitions. [2022-01-11 01:48:52,991 INFO L78 Accepts]: Start accepts. Automaton has 8188 states and 10140 transitions. Word has length 107 [2022-01-11 01:48:52,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:52,992 INFO L470 AbstractCegarLoop]: Abstraction has 8188 states and 10140 transitions. [2022-01-11 01:48:52,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 8188 states and 10140 transitions. [2022-01-11 01:48:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 01:48:52,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:52,996 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] [2022-01-11 01:48:52,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:48:52,996 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-11 01:48:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:52,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1902063775, now seen corresponding path program 1 times [2022-01-11 01:48:52,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:52,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221677584] [2022-01-11 01:48:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:52,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:48:53,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:53,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221677584] [2022-01-11 01:48:53,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221677584] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:53,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:53,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:53,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504008349] [2022-01-11 01:48:53,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:53,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:53,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:53,021 INFO L87 Difference]: Start difference. First operand 8188 states and 10140 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:53,510 INFO L93 Difference]: Finished difference Result 14181 states and 17600 transitions. [2022-01-11 01:48:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:53,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-11 01:48:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:53,517 INFO L225 Difference]: With dead ends: 14181 [2022-01-11 01:48:53,517 INFO L226 Difference]: Without dead ends: 8142 [2022-01-11 01:48:53,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:53,524 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 405 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:53,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 664 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8142 states. [2022-01-11 01:48:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8142 to 8142. [2022-01-11 01:48:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8142 states, 8139 states have (on average 1.239464307654503) internal successors, (10088), 8141 states have internal predecessors, (10088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8142 states to 8142 states and 10088 transitions. [2022-01-11 01:48:54,035 INFO L78 Accepts]: Start accepts. Automaton has 8142 states and 10088 transitions. Word has length 107 [2022-01-11 01:48:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:54,035 INFO L470 AbstractCegarLoop]: Abstraction has 8142 states and 10088 transitions. [2022-01-11 01:48:54,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8142 states and 10088 transitions. [2022-01-11 01:48:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 01:48:54,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:54,040 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] [2022-01-11 01:48:54,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:48:54,042 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-11 01:48:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 22501287, now seen corresponding path program 1 times [2022-01-11 01:48:54,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:54,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294574891] [2022-01-11 01:48:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:54,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:54,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:54,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294574891] [2022-01-11 01:48:54,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294574891] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:54,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:54,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:54,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929127832] [2022-01-11 01:48:54,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:54,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:54,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:54,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:54,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:54,089 INFO L87 Difference]: Start difference. First operand 8142 states and 10088 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:54,854 INFO L93 Difference]: Finished difference Result 18971 states and 23565 transitions. [2022-01-11 01:48:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:54,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-11 01:48:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:54,867 INFO L225 Difference]: With dead ends: 18971 [2022-01-11 01:48:54,867 INFO L226 Difference]: Without dead ends: 12995 [2022-01-11 01:48:54,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:54,872 INFO L933 BasicCegarLoop]: 616 mSDtfsCounter, 395 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:54,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 1005 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12995 states. [2022-01-11 01:48:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12995 to 12991. [2022-01-11 01:48:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12991 states, 12988 states have (on average 1.236910994764398) internal successors, (16065), 12990 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12991 states to 12991 states and 16065 transitions. [2022-01-11 01:48:55,788 INFO L78 Accepts]: Start accepts. Automaton has 12991 states and 16065 transitions. Word has length 108 [2022-01-11 01:48:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:55,788 INFO L470 AbstractCegarLoop]: Abstraction has 12991 states and 16065 transitions. [2022-01-11 01:48:55,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 12991 states and 16065 transitions. [2022-01-11 01:48:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 01:48:55,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:55,794 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] [2022-01-11 01:48:55,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:48:55,795 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-11 01:48:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1176233978, now seen corresponding path program 1 times [2022-01-11 01:48:55,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:55,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118395910] [2022-01-11 01:48:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:55,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:48:55,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118395910] [2022-01-11 01:48:55,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118395910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:55,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:55,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:55,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539977880] [2022-01-11 01:48:55,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:55,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:55,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:55,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:55,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:55,823 INFO L87 Difference]: Start difference. First operand 12991 states and 16065 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:56,715 INFO L93 Difference]: Finished difference Result 23771 states and 29435 transitions. [2022-01-11 01:48:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:56,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 108 [2022-01-11 01:48:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:56,729 INFO L225 Difference]: With dead ends: 23771 [2022-01-11 01:48:56,729 INFO L226 Difference]: Without dead ends: 12946 [2022-01-11 01:48:56,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:56,736 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 403 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:56,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 663 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12946 states. [2022-01-11 01:48:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12946 to 12946. [2022-01-11 01:48:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12946 states, 12943 states have (on average 1.23734837363826) internal successors, (16015), 12945 states have internal predecessors, (16015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12946 states to 12946 states and 16015 transitions. [2022-01-11 01:48:57,568 INFO L78 Accepts]: Start accepts. Automaton has 12946 states and 16015 transitions. Word has length 108 [2022-01-11 01:48:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:57,568 INFO L470 AbstractCegarLoop]: Abstraction has 12946 states and 16015 transitions. [2022-01-11 01:48:57,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 12946 states and 16015 transitions. [2022-01-11 01:48:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 01:48:57,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:57,572 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] [2022-01-11 01:48:57,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:48:57,572 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-11 01:48:57,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:57,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1389049390, now seen corresponding path program 1 times [2022-01-11 01:48:57,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:57,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138294150] [2022-01-11 01:48:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:57,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:57,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:57,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138294150] [2022-01-11 01:48:57,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138294150] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:57,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:57,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:57,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957053148] [2022-01-11 01:48:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:57,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:57,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:57,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:57,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:57,607 INFO L87 Difference]: Start difference. First operand 12946 states and 16015 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:58,951 INFO L93 Difference]: Finished difference Result 33094 states and 40837 transitions. [2022-01-11 01:48:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:58,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-01-11 01:48:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:58,969 INFO L225 Difference]: With dead ends: 33094 [2022-01-11 01:48:58,969 INFO L226 Difference]: Without dead ends: 17674 [2022-01-11 01:48:58,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:58,980 INFO L933 BasicCegarLoop]: 862 mSDtfsCounter, 332 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:58,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 1384 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2022-01-11 01:49:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17674. [2022-01-11 01:49:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17674 states, 17671 states have (on average 1.228792937581348) internal successors, (21714), 17673 states have internal predecessors, (21714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17674 states to 17674 states and 21714 transitions. [2022-01-11 01:49:00,278 INFO L78 Accepts]: Start accepts. Automaton has 17674 states and 21714 transitions. Word has length 109 [2022-01-11 01:49:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:00,278 INFO L470 AbstractCegarLoop]: Abstraction has 17674 states and 21714 transitions. [2022-01-11 01:49:00,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17674 states and 21714 transitions. [2022-01-11 01:49:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:00,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:00,282 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:00,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:49:00,282 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2087372408, now seen corresponding path program 1 times [2022-01-11 01:49:00,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:00,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594320908] [2022-01-11 01:49:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:00,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-11 01:49:00,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:00,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594320908] [2022-01-11 01:49:00,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594320908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:00,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:00,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:00,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107706075] [2022-01-11 01:49:00,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:00,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:00,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:00,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:00,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:00,307 INFO L87 Difference]: Start difference. First operand 17674 states and 21714 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:01,497 INFO L93 Difference]: Finished difference Result 20844 states and 25697 transitions. [2022-01-11 01:49:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:01,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 01:49:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:01,519 INFO L225 Difference]: With dead ends: 20844 [2022-01-11 01:49:01,519 INFO L226 Difference]: Without dead ends: 18989 [2022-01-11 01:49:01,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:01,528 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 513 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:01,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 628 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18989 states. [2022-01-11 01:49:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18989 to 18817. [2022-01-11 01:49:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18817 states, 18814 states have (on average 1.2302009142128203) internal successors, (23145), 18816 states have internal predecessors, (23145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18817 states to 18817 states and 23145 transitions. [2022-01-11 01:49:02,703 INFO L78 Accepts]: Start accepts. Automaton has 18817 states and 23145 transitions. Word has length 110 [2022-01-11 01:49:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:02,703 INFO L470 AbstractCegarLoop]: Abstraction has 18817 states and 23145 transitions. [2022-01-11 01:49:02,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18817 states and 23145 transitions. [2022-01-11 01:49:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:02,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:02,707 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:02,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:49:02,707 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash 326953728, now seen corresponding path program 1 times [2022-01-11 01:49:02,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:02,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228329725] [2022-01-11 01:49:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:02,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:49:02,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:02,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228329725] [2022-01-11 01:49:02,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228329725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:02,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:02,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:02,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781996946] [2022-01-11 01:49:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:02,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:02,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:02,740 INFO L87 Difference]: Start difference. First operand 18817 states and 23145 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:03,989 INFO L93 Difference]: Finished difference Result 21827 states and 26901 transitions. [2022-01-11 01:49:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:03,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 01:49:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:04,012 INFO L225 Difference]: With dead ends: 21827 [2022-01-11 01:49:04,012 INFO L226 Difference]: Without dead ends: 18833 [2022-01-11 01:49:04,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:04,021 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 69 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:04,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 934 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18833 states. [2022-01-11 01:49:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18833 to 18833. [2022-01-11 01:49:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18833 states, 18830 states have (on average 1.2273499734466278) internal successors, (23111), 18832 states have internal predecessors, (23111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18833 states to 18833 states and 23111 transitions. [2022-01-11 01:49:05,371 INFO L78 Accepts]: Start accepts. Automaton has 18833 states and 23111 transitions. Word has length 110 [2022-01-11 01:49:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:05,371 INFO L470 AbstractCegarLoop]: Abstraction has 18833 states and 23111 transitions. [2022-01-11 01:49:05,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 18833 states and 23111 transitions. [2022-01-11 01:49:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:05,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:05,375 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:05,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:49:05,375 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 86413599, now seen corresponding path program 1 times [2022-01-11 01:49:05,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:05,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340228130] [2022-01-11 01:49:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:05,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:49:05,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:05,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340228130] [2022-01-11 01:49:05,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340228130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:05,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:05,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:05,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041035469] [2022-01-11 01:49:05,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:05,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:05,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:05,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:05,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:05,411 INFO L87 Difference]: Start difference. First operand 18833 states and 23111 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:06,468 INFO L93 Difference]: Finished difference Result 20301 states and 24908 transitions. [2022-01-11 01:49:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:06,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 01:49:06,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:06,486 INFO L225 Difference]: With dead ends: 20301 [2022-01-11 01:49:06,486 INFO L226 Difference]: Without dead ends: 17191 [2022-01-11 01:49:06,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:06,492 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 487 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:06,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [487 Valid, 544 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17191 states. [2022-01-11 01:49:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17191 to 17092. [2022-01-11 01:49:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17092 states, 17089 states have (on average 1.2248229855462578) internal successors, (20931), 17091 states have internal predecessors, (20931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17092 states to 17092 states and 20931 transitions. [2022-01-11 01:49:07,594 INFO L78 Accepts]: Start accepts. Automaton has 17092 states and 20931 transitions. Word has length 110 [2022-01-11 01:49:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:07,594 INFO L470 AbstractCegarLoop]: Abstraction has 17092 states and 20931 transitions. [2022-01-11 01:49:07,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17092 states and 20931 transitions. [2022-01-11 01:49:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-11 01:49:07,600 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:07,601 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] [2022-01-11 01:49:07,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:49:07,601 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-11 01:49:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1104844494, now seen corresponding path program 1 times [2022-01-11 01:49:07,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:07,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171301820] [2022-01-11 01:49:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:07,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:07,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:07,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171301820] [2022-01-11 01:49:07,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171301820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:07,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:07,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:07,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655847397] [2022-01-11 01:49:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:07,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:07,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:07,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:07,642 INFO L87 Difference]: Start difference. First operand 17092 states and 20931 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:09,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:09,015 INFO L93 Difference]: Finished difference Result 37234 states and 45567 transitions. [2022-01-11 01:49:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2022-01-11 01:49:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:09,037 INFO L225 Difference]: With dead ends: 37234 [2022-01-11 01:49:09,037 INFO L226 Difference]: Without dead ends: 21711 [2022-01-11 01:49:09,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:09,049 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 352 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:09,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 855 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21711 states. [2022-01-11 01:49:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21711 to 21615. [2022-01-11 01:49:10,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21615 states, 21612 states have (on average 1.2152970571904498) internal successors, (26265), 21614 states have internal predecessors, (26265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21615 states to 21615 states and 26265 transitions. [2022-01-11 01:49:10,503 INFO L78 Accepts]: Start accepts. Automaton has 21615 states and 26265 transitions. Word has length 140 [2022-01-11 01:49:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:10,503 INFO L470 AbstractCegarLoop]: Abstraction has 21615 states and 26265 transitions. [2022-01-11 01:49:10,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21615 states and 26265 transitions. [2022-01-11 01:49:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 01:49:10,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,514 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:10,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:49:10,514 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-11 01:49:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 778947388, now seen corresponding path program 1 times [2022-01-11 01:49:10,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809861281] [2022-01-11 01:49:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-11 01:49:10,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:10,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809861281] [2022-01-11 01:49:10,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809861281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:10,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:10,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:10,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251219680] [2022-01-11 01:49:10,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:10,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:10,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:10,547 INFO L87 Difference]: Start difference. First operand 21615 states and 26265 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:12,046 INFO L93 Difference]: Finished difference Result 41227 states and 50047 transitions. [2022-01-11 01:49:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 157 [2022-01-11 01:49:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,066 INFO L225 Difference]: With dead ends: 41227 [2022-01-11 01:49:12,067 INFO L226 Difference]: Without dead ends: 21195 [2022-01-11 01:49:12,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:12,083 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 390 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:12,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 875 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21195 states. [2022-01-11 01:49:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21195 to 21195. [2022-01-11 01:49:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21195 states, 21192 states have (on average 1.1948376745941864) internal successors, (25321), 21194 states have internal predecessors, (25321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21195 states to 21195 states and 25321 transitions. [2022-01-11 01:49:13,491 INFO L78 Accepts]: Start accepts. Automaton has 21195 states and 25321 transitions. Word has length 157 [2022-01-11 01:49:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:13,491 INFO L470 AbstractCegarLoop]: Abstraction has 21195 states and 25321 transitions. [2022-01-11 01:49:13,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 21195 states and 25321 transitions. [2022-01-11 01:49:13,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 01:49:13,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:13,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:13,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:49:13,503 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-11 01:49:13,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1427271145, now seen corresponding path program 1 times [2022-01-11 01:49:13,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:13,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396864411] [2022-01-11 01:49:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:13,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:13,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396864411] [2022-01-11 01:49:13,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396864411] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:13,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:13,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:13,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994924851] [2022-01-11 01:49:13,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:13,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:13,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:13,545 INFO L87 Difference]: Start difference. First operand 21195 states and 25321 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:14,946 INFO L93 Difference]: Finished difference Result 36371 states and 43633 transitions. [2022-01-11 01:49:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:14,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2022-01-11 01:49:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:14,968 INFO L225 Difference]: With dead ends: 36371 [2022-01-11 01:49:14,968 INFO L226 Difference]: Without dead ends: 21199 [2022-01-11 01:49:14,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:14,982 INFO L933 BasicCegarLoop]: 789 mSDtfsCounter, 288 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:14,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 1302 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:14,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21199 states. [2022-01-11 01:49:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21199 to 21195. [2022-01-11 01:49:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21195 states, 21192 states have (on average 1.1920064175160439) internal successors, (25261), 21194 states have internal predecessors, (25261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21195 states to 21195 states and 25261 transitions. [2022-01-11 01:49:16,441 INFO L78 Accepts]: Start accepts. Automaton has 21195 states and 25261 transitions. Word has length 158 [2022-01-11 01:49:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:16,441 INFO L470 AbstractCegarLoop]: Abstraction has 21195 states and 25261 transitions. [2022-01-11 01:49:16,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21195 states and 25261 transitions. [2022-01-11 01:49:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 01:49:16,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:16,450 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:16,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:49:16,450 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1471697368, now seen corresponding path program 1 times [2022-01-11 01:49:16,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969875601] [2022-01-11 01:49:16,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:16,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-01-11 01:49:16,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969875601] [2022-01-11 01:49:16,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969875601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:16,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:16,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:16,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647042690] [2022-01-11 01:49:16,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:16,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:16,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:16,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:16,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,491 INFO L87 Difference]: Start difference. First operand 21195 states and 25261 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:17,765 INFO L93 Difference]: Finished difference Result 22578 states and 26908 transitions. [2022-01-11 01:49:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-01-11 01:49:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:17,791 INFO L225 Difference]: With dead ends: 22578 [2022-01-11 01:49:17,791 INFO L226 Difference]: Without dead ends: 21164 [2022-01-11 01:49:17,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,798 INFO L933 BasicCegarLoop]: 576 mSDtfsCounter, 69 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:17,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1059 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21164 states. [2022-01-11 01:49:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21164 to 21161. [2022-01-11 01:49:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21161 states, 21158 states have (on average 1.1904244257491257) internal successors, (25187), 21160 states have internal predecessors, (25187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21161 states to 21161 states and 25187 transitions. [2022-01-11 01:49:19,307 INFO L78 Accepts]: Start accepts. Automaton has 21161 states and 25187 transitions. Word has length 162 [2022-01-11 01:49:19,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,307 INFO L470 AbstractCegarLoop]: Abstraction has 21161 states and 25187 transitions. [2022-01-11 01:49:19,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 21161 states and 25187 transitions. [2022-01-11 01:49:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-11 01:49:19,317 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,318 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:19,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:49:19,318 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1983166166, now seen corresponding path program 1 times [2022-01-11 01:49:19,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378113519] [2022-01-11 01:49:19,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-01-11 01:49:19,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378113519] [2022-01-11 01:49:19,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378113519] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:19,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196700449] [2022-01-11 01:49:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,413 INFO L87 Difference]: Start difference. First operand 21161 states and 25187 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,717 INFO L93 Difference]: Finished difference Result 22228 states and 26410 transitions. [2022-01-11 01:49:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-01-11 01:49:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,743 INFO L225 Difference]: With dead ends: 22228 [2022-01-11 01:49:20,743 INFO L226 Difference]: Without dead ends: 20397 [2022-01-11 01:49:20,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:20,749 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 6 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:20,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 1057 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20397 states. [2022-01-11 01:49:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20397 to 20389. [2022-01-11 01:49:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20389 states, 20386 states have (on average 1.1899342686157166) internal successors, (24258), 20388 states have internal predecessors, (24258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20389 states to 20389 states and 24258 transitions. [2022-01-11 01:49:22,073 INFO L78 Accepts]: Start accepts. Automaton has 20389 states and 24258 transitions. Word has length 164 [2022-01-11 01:49:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:22,073 INFO L470 AbstractCegarLoop]: Abstraction has 20389 states and 24258 transitions. [2022-01-11 01:49:22,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 20389 states and 24258 transitions. [2022-01-11 01:49:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-11 01:49:22,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:22,080 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:22,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:49:22,080 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1181014505, now seen corresponding path program 1 times [2022-01-11 01:49:22,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:22,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144752509] [2022-01-11 01:49:22,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:22,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-11 01:49:22,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:22,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144752509] [2022-01-11 01:49:22,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144752509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:22,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:22,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:22,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808573469] [2022-01-11 01:49:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:22,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:22,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:22,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:22,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,113 INFO L87 Difference]: Start difference. First operand 20389 states and 24258 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:23,333 INFO L93 Difference]: Finished difference Result 20392 states and 24261 transitions. [2022-01-11 01:49:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:23,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-01-11 01:49:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:23,354 INFO L225 Difference]: With dead ends: 20392 [2022-01-11 01:49:23,354 INFO L226 Difference]: Without dead ends: 19665 [2022-01-11 01:49:23,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:23,358 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 407 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:23,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 573 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:23,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19665 states. [2022-01-11 01:49:24,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19665 to 19665. [2022-01-11 01:49:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19665 states, 19663 states have (on average 1.1930020851345167) internal successors, (23458), 19664 states have internal predecessors, (23458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 23458 transitions. [2022-01-11 01:49:24,539 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 23458 transitions. Word has length 164 [2022-01-11 01:49:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:24,539 INFO L470 AbstractCegarLoop]: Abstraction has 19665 states and 23458 transitions. [2022-01-11 01:49:24,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 23458 transitions. [2022-01-11 01:49:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-11 01:49:24,547 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:24,548 INFO L514 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:24,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:49:24,548 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-11 01:49:24,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:24,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1163619447, now seen corresponding path program 1 times [2022-01-11 01:49:24,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:24,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951888682] [2022-01-11 01:49:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:24,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-11 01:49:24,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:24,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951888682] [2022-01-11 01:49:24,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951888682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:24,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:24,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:24,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767739362] [2022-01-11 01:49:24,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:24,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:24,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:24,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:24,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:24,591 INFO L87 Difference]: Start difference. First operand 19665 states and 23458 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:26,076 INFO L93 Difference]: Finished difference Result 43353 states and 51585 transitions. [2022-01-11 01:49:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 189 [2022-01-11 01:49:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:26,109 INFO L225 Difference]: With dead ends: 43353 [2022-01-11 01:49:26,109 INFO L226 Difference]: Without dead ends: 23720 [2022-01-11 01:49:26,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:26,131 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 179 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:26,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 735 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23720 states. [2022-01-11 01:49:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23720 to 23592. [2022-01-11 01:49:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23592 states, 23590 states have (on average 1.183891479440441) internal successors, (27928), 23591 states have internal predecessors, (27928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23592 states to 23592 states and 27928 transitions. [2022-01-11 01:49:27,646 INFO L78 Accepts]: Start accepts. Automaton has 23592 states and 27928 transitions. Word has length 189 [2022-01-11 01:49:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:27,647 INFO L470 AbstractCegarLoop]: Abstraction has 23592 states and 27928 transitions. [2022-01-11 01:49:27,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states and 27928 transitions. [2022-01-11 01:49:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-01-11 01:49:27,660 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:27,660 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:27,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:49:27,661 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-11 01:49:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1669477115, now seen corresponding path program 1 times [2022-01-11 01:49:27,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:27,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088979740] [2022-01-11 01:49:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:27,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:27,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:27,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088979740] [2022-01-11 01:49:27,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088979740] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:27,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:27,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:27,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567501195] [2022-01-11 01:49:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:27,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:27,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:27,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:27,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:27,703 INFO L87 Difference]: Start difference. First operand 23592 states and 27928 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:29,253 INFO L93 Difference]: Finished difference Result 43208 states and 51332 transitions. [2022-01-11 01:49:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:29,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2022-01-11 01:49:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:29,281 INFO L225 Difference]: With dead ends: 43208 [2022-01-11 01:49:29,281 INFO L226 Difference]: Without dead ends: 23596 [2022-01-11 01:49:29,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:29,300 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 280 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:29,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1035 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:29,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23596 states. [2022-01-11 01:49:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23596 to 23592. [2022-01-11 01:49:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23592 states, 23590 states have (on average 1.179652395082662) internal successors, (27828), 23591 states have internal predecessors, (27828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23592 states to 23592 states and 27828 transitions. [2022-01-11 01:49:30,850 INFO L78 Accepts]: Start accepts. Automaton has 23592 states and 27828 transitions. Word has length 193 [2022-01-11 01:49:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:30,850 INFO L470 AbstractCegarLoop]: Abstraction has 23592 states and 27828 transitions. [2022-01-11 01:49:30,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states and 27828 transitions. [2022-01-11 01:49:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-01-11 01:49:30,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:30,862 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:30,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:49:30,862 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-11 01:49:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1845833031, now seen corresponding path program 1 times [2022-01-11 01:49:30,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:30,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878787772] [2022-01-11 01:49:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:30,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:30,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:30,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878787772] [2022-01-11 01:49:30,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878787772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:30,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:30,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:30,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715005257] [2022-01-11 01:49:30,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:30,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:30,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:30,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:30,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:30,904 INFO L87 Difference]: Start difference. First operand 23592 states and 27828 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)