/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.06.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:48:54,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:48:54,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:48:55,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:48:55,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:48:55,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:48:55,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:48:55,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:48:55,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:48:55,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:48:55,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:48:55,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:48:55,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:48:55,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:48:55,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:48:55,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:48:55,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:48:55,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:48:55,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:48:55,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:48:55,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:48:55,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:48:55,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:48:55,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:48:55,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:48:55,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:48:55,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:48:55,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:48:55,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:48:55,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:48:55,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:48:55,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:48:55,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:48:55,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:48:55,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:48:55,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:48:55,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:48:55,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:48:55,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:48:55,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:48:55,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:48:55,048 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:55,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:48:55,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:48:55,067 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:48:55,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:48:55,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:48:55,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:48:55,069 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:48:55,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:48:55,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:48:55,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:48:55,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:48:55,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:48:55,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:48:55,070 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:48:55,070 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:48:55,070 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:48:55,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:48:55,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:48:55,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:48:55,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:48:55,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:48:55,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:48:55,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:48:55,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:48:55,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:48:55,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:48:55,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:48:55,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:48:55,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:48:55,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:48:55,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:48:55,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:48:55,073 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:48:55,073 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:55,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:48:55,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:48:55,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:48:55,268 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:48:55,269 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:48:55,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2022-01-11 01:48:55,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37d519e3/bd0e12198ce84281825bf409166dd8bc/FLAG136fc1e4c [2022-01-11 01:48:55,696 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:48:55,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2022-01-11 01:48:55,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37d519e3/bd0e12198ce84281825bf409166dd8bc/FLAG136fc1e4c [2022-01-11 01:48:56,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37d519e3/bd0e12198ce84281825bf409166dd8bc [2022-01-11 01:48:56,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:48:56,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:48:56,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:48:56,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:48:56,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:48:56,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:48:56" (1/1) ... [2022-01-11 01:48:56,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1ecef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:56, skipping insertion in model container [2022-01-11 01:48:56,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:48:56" (1/1) ... [2022-01-11 01:48:56,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:48:56,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:48:56,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2022-01-11 01:48:56,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2022-01-11 01:48:56,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:48:56,343 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:48:56,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2022-01-11 01:48:56,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2022-01-11 01:48:56,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:48:56,397 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:48:56,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:56 WrapperNode [2022-01-11 01:48:56,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:48:56,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:48:56,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:48:56,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:48:56,403 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:56" (1/1) ... [2022-01-11 01:48:56,411 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:56" (1/1) ... [2022-01-11 01:48:56,453 INFO L137 Inliner]: procedures = 66, calls = 76, calls flagged for inlining = 71, calls inlined = 141, statements flattened = 1963 [2022-01-11 01:48:56,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:48:56,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:48:56,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:48:56,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:48:56,460 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:56" (1/1) ... [2022-01-11 01:48:56,460 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:56" (1/1) ... [2022-01-11 01:48:56,465 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:56" (1/1) ... [2022-01-11 01:48:56,466 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:56" (1/1) ... [2022-01-11 01:48:56,480 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:56" (1/1) ... [2022-01-11 01:48:56,493 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:56" (1/1) ... [2022-01-11 01:48:56,498 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:56" (1/1) ... [2022-01-11 01:48:56,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:48:56,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:48:56,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:48:56,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:48:56,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:56" (1/1) ... [2022-01-11 01:48:56,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:48:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:48:56,588 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:56,654 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:56,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:48:56,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:48:56,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:48:56,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:48:56,806 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:48:56,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:48:57,655 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:48:57,668 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:48:57,668 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-01-11 01:48:57,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:57 BoogieIcfgContainer [2022-01-11 01:48:57,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:48:57,671 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:48:57,671 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:48:57,672 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:48:57,674 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:57" (1/1) ... [2022-01-11 01:48:57,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:48:57 BasicIcfg [2022-01-11 01:48:57,934 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:48:57,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:48:57,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:48:57,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:48:57,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:48:56" (1/4) ... [2022-01-11 01:48:57,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc70a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:48:57, skipping insertion in model container [2022-01-11 01:48:57,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:56" (2/4) ... [2022-01-11 01:48:57,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc70a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:48:57, skipping insertion in model container [2022-01-11 01:48:57,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:57" (3/4) ... [2022-01-11 01:48:57,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc70a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:48:57, skipping insertion in model container [2022-01-11 01:48:57,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:48:57" (4/4) ... [2022-01-11 01:48:57,939 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.cTransformedIcfg [2022-01-11 01:48:57,945 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:48:57,945 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:48:57,986 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:48:57,990 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:57,990 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:48:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 799 states, 794 states have (on average 1.5340050377833754) internal successors, (1218), 798 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have 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,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:58,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:58,021 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:58,022 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:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1476392373, now seen corresponding path program 1 times [2022-01-11 01:48:58,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:58,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741311103] [2022-01-11 01:48:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:58,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:58,300 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:58,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:58,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741311103] [2022-01-11 01:48:58,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741311103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:58,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:58,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:58,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677371222] [2022-01-11 01:48:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:58,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:58,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:58,329 INFO L87 Difference]: Start difference. First operand has 799 states, 794 states have (on average 1.5340050377833754) internal successors, (1218), 798 states have internal predecessors, (1218), 0 states have call successors, (0), 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:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:58,495 INFO L93 Difference]: Finished difference Result 1590 states and 2417 transitions. [2022-01-11 01:48:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:58,498 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:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:58,517 INFO L225 Difference]: With dead ends: 1590 [2022-01-11 01:48:58,517 INFO L226 Difference]: Without dead ends: 882 [2022-01-11 01:48:58,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:58,526 INFO L933 BasicCegarLoop]: 1180 mSDtfsCounter, 124 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2330 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:58,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 2330 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-01-11 01:48:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 878. [2022-01-11 01:48:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 874 states have (on average 1.4851258581235698) internal successors, (1298), 877 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have 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,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1298 transitions. [2022-01-11 01:48:58,613 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1298 transitions. Word has length 44 [2022-01-11 01:48:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:58,613 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1298 transitions. [2022-01-11 01:48:58,614 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:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1298 transitions. [2022-01-11 01:48:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:58,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:58,618 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:58,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:48:58,619 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:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:58,620 INFO L85 PathProgramCache]: Analyzing trace with hash -706826898, now seen corresponding path program 1 times [2022-01-11 01:48:58,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:58,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36856952] [2022-01-11 01:48:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:58,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:58,710 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:58,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:58,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36856952] [2022-01-11 01:48:58,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36856952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:58,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:58,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:58,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097016505] [2022-01-11 01:48:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:58,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:58,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:58,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:58,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:58,718 INFO L87 Difference]: Start difference. First operand 878 states and 1298 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:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:58,772 INFO L93 Difference]: Finished difference Result 1164 states and 1696 transitions. [2022-01-11 01:48:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:58,772 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:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:58,776 INFO L225 Difference]: With dead ends: 1164 [2022-01-11 01:48:58,777 INFO L226 Difference]: Without dead ends: 1034 [2022-01-11 01:48:58,778 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,779 INFO L933 BasicCegarLoop]: 1173 mSDtfsCounter, 1136 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1291 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:58,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1136 Valid, 1291 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:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-01-11 01:48:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1030. [2022-01-11 01:48:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1026 states have (on average 1.46588693957115) internal successors, (1504), 1029 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have 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,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1504 transitions. [2022-01-11 01:48:58,856 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1504 transitions. Word has length 44 [2022-01-11 01:48:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:58,856 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1504 transitions. [2022-01-11 01:48:58,856 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:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1504 transitions. [2022-01-11 01:48:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:48:58,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:58,857 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:58,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:48:58,858 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:58,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash 789529795, now seen corresponding path program 1 times [2022-01-11 01:48:58,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:58,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849983080] [2022-01-11 01:48:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:58,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:58,935 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:58,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:58,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849983080] [2022-01-11 01:48:58,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849983080] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:58,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:58,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:58,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258551085] [2022-01-11 01:48:58,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:58,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:58,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:58,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:58,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:58,937 INFO L87 Difference]: Start difference. First operand 1030 states and 1504 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:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:58,984 INFO L93 Difference]: Finished difference Result 1578 states and 2264 transitions. [2022-01-11 01:48:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:58,985 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:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:58,988 INFO L225 Difference]: With dead ends: 1578 [2022-01-11 01:48:58,988 INFO L226 Difference]: Without dead ends: 1243 [2022-01-11 01:48:58,990 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,994 INFO L933 BasicCegarLoop]: 1168 mSDtfsCounter, 94 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2280 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:58,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 2280 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:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-01-11 01:48:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1229. [2022-01-11 01:48:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1225 states have (on average 1.446530612244898) internal successors, (1772), 1228 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have 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:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1772 transitions. [2022-01-11 01:48:59,024 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1772 transitions. Word has length 45 [2022-01-11 01:48:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:59,024 INFO L470 AbstractCegarLoop]: Abstraction has 1229 states and 1772 transitions. [2022-01-11 01:48:59,024 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:59,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1772 transitions. [2022-01-11 01:48:59,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:48:59,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:59,027 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:59,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:48:59,027 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:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash 819112258, now seen corresponding path program 1 times [2022-01-11 01:48:59,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:59,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491903380] [2022-01-11 01:48:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:59,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:59,073 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:59,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:59,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491903380] [2022-01-11 01:48:59,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491903380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:59,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:59,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:59,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29595716] [2022-01-11 01:48:59,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:59,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:59,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:59,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:59,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:59,076 INFO L87 Difference]: Start difference. First operand 1229 states and 1772 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:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:59,118 INFO L93 Difference]: Finished difference Result 2117 states and 2984 transitions. [2022-01-11 01:48:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:59,118 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:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:59,123 INFO L225 Difference]: With dead ends: 2117 [2022-01-11 01:48:59,124 INFO L226 Difference]: Without dead ends: 1641 [2022-01-11 01:48:59,124 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:59,129 INFO L933 BasicCegarLoop]: 1168 mSDtfsCounter, 1124 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1257 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:59,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 1257 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:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-01-11 01:48:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1609. [2022-01-11 01:48:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1605 states have (on average 1.415576323987539) internal successors, (2272), 1608 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have 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:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2272 transitions. [2022-01-11 01:48:59,169 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2272 transitions. Word has length 45 [2022-01-11 01:48:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:59,170 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 2272 transitions. [2022-01-11 01:48:59,170 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:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2272 transitions. [2022-01-11 01:48:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:48:59,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:59,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:59,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:48:59,171 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:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash -977330114, now seen corresponding path program 1 times [2022-01-11 01:48:59,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:59,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530612241] [2022-01-11 01:48:59,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:59,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:59,215 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:59,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:59,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530612241] [2022-01-11 01:48:59,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530612241] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:59,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:59,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:59,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025940914] [2022-01-11 01:48:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:59,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:59,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:59,217 INFO L87 Difference]: Start difference. First operand 1609 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:59,274 INFO L93 Difference]: Finished difference Result 2812 states and 3885 transitions. [2022-01-11 01:48:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:59,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 01:48:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:59,280 INFO L225 Difference]: With dead ends: 2812 [2022-01-11 01:48:59,280 INFO L226 Difference]: Without dead ends: 1928 [2022-01-11 01:48:59,281 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:59,281 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 1121 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1261 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:59,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 1261 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:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-01-11 01:48:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1906. [2022-01-11 01:48:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1902 states have (on average 1.396950578338591) internal successors, (2657), 1905 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have 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:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2657 transitions. [2022-01-11 01:48:59,334 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2657 transitions. Word has length 51 [2022-01-11 01:48:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:59,336 INFO L470 AbstractCegarLoop]: Abstraction has 1906 states and 2657 transitions. [2022-01-11 01:48:59,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2657 transitions. [2022-01-11 01:48:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:59,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:59,342 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:59,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:48:59,342 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:59,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1683070771, now seen corresponding path program 1 times [2022-01-11 01:48:59,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:59,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442194679] [2022-01-11 01:48:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:59,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:59,413 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:59,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:59,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442194679] [2022-01-11 01:48:59,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442194679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:59,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:59,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:59,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584135523] [2022-01-11 01:48:59,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:59,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:59,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:59,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:59,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:59,415 INFO L87 Difference]: Start difference. First operand 1906 states and 2657 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:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:59,564 INFO L93 Difference]: Finished difference Result 3532 states and 4861 transitions. [2022-01-11 01:48:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:59,564 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:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:59,570 INFO L225 Difference]: With dead ends: 3532 [2022-01-11 01:48:59,570 INFO L226 Difference]: Without dead ends: 2581 [2022-01-11 01:48:59,572 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:59,572 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 395 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 4753 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:59,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 4753 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:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2022-01-11 01:48:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 1930. [2022-01-11 01:48:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1926 states have (on average 1.3826583592938733) internal successors, (2663), 1929 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have 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:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2663 transitions. [2022-01-11 01:48:59,640 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2663 transitions. Word has length 52 [2022-01-11 01:48:59,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:59,640 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 2663 transitions. [2022-01-11 01:48:59,640 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:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2663 transitions. [2022-01-11 01:48:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:59,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:59,641 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:59,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:48:59,641 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:59,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash -661596270, now seen corresponding path program 1 times [2022-01-11 01:48:59,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:59,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96266707] [2022-01-11 01:48:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:59,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:59,697 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:59,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:59,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96266707] [2022-01-11 01:48:59,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96266707] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:59,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:59,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:59,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151575138] [2022-01-11 01:48:59,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:59,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:59,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:59,699 INFO L87 Difference]: Start difference. First operand 1930 states and 2663 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:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:59,830 INFO L93 Difference]: Finished difference Result 3685 states and 5012 transitions. [2022-01-11 01:48:59,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:59,830 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:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:59,838 INFO L225 Difference]: With dead ends: 3685 [2022-01-11 01:48:59,838 INFO L226 Difference]: Without dead ends: 2520 [2022-01-11 01:48:59,840 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:59,841 INFO L933 BasicCegarLoop]: 1160 mSDtfsCounter, 354 mSDsluCounter, 3609 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 4769 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:59,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 4769 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:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-01-11 01:48:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1948. [2022-01-11 01:48:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1944 states have (on average 1.3688271604938271) internal successors, (2661), 1947 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have 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:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2661 transitions. [2022-01-11 01:48:59,958 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2661 transitions. Word has length 52 [2022-01-11 01:48:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:59,959 INFO L470 AbstractCegarLoop]: Abstraction has 1948 states and 2661 transitions. [2022-01-11 01:48:59,959 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:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2661 transitions. [2022-01-11 01:48:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:59,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:59,960 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:59,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:48:59,960 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:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash -650280143, now seen corresponding path program 1 times [2022-01-11 01:48:59,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:59,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211188297] [2022-01-11 01:48:59,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:59,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:00,039 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:49:00,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:00,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211188297] [2022-01-11 01:49:00,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211188297] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:00,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:00,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:49:00,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829263928] [2022-01-11 01:49:00,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:00,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:49:00,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:49:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:49:00,040 INFO L87 Difference]: Start difference. First operand 1948 states and 2661 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:49:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:00,163 INFO L93 Difference]: Finished difference Result 2180 states and 2961 transitions. [2022-01-11 01:49:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:49:00,164 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:49:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:00,170 INFO L225 Difference]: With dead ends: 2180 [2022-01-11 01:49:00,170 INFO L226 Difference]: Without dead ends: 2178 [2022-01-11 01:49:00,171 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:49:00,171 INFO L933 BasicCegarLoop]: 1169 mSDtfsCounter, 2381 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 1257 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:49:00,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2381 Valid, 1257 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2022-01-11 01:49:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1946. [2022-01-11 01:49:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1943 states have (on average 1.3648996397323727) internal successors, (2652), 1945 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have 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,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2652 transitions. [2022-01-11 01:49:00,273 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2652 transitions. Word has length 52 [2022-01-11 01:49:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:00,274 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 2652 transitions. [2022-01-11 01:49:00,274 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:49:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2652 transitions. [2022-01-11 01:49:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 01:49:00,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:00,275 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:49:00,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:49:00,275 INFO L402 AbstractCegarLoop]: === Iteration 9 === 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,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1316154301, now seen corresponding path program 1 times [2022-01-11 01:49:00,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:00,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697761670] [2022-01-11 01:49:00,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:00,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:00,430 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:49:00,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697761670] [2022-01-11 01:49:00,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697761670] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:49:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579768325] [2022-01-11 01:49:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:00,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:49:00,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:49:00,432 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:49:00,463 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:49:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:00,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:49:00,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:49:00,835 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:49:00,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:49:01,097 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:49:01,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579768325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:49:01,098 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:49:01,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:49:01,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713334323] [2022-01-11 01:49:01,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:49:01,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:49:01,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:49:01,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:49:01,099 INFO L87 Difference]: Start difference. First operand 1946 states and 2652 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:49:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:01,472 INFO L93 Difference]: Finished difference Result 4303 states and 5752 transitions. [2022-01-11 01:49:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:49:01,472 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:49:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:01,483 INFO L225 Difference]: With dead ends: 4303 [2022-01-11 01:49:01,483 INFO L226 Difference]: Without dead ends: 4301 [2022-01-11 01:49:01,484 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:49:01,485 INFO L933 BasicCegarLoop]: 1320 mSDtfsCounter, 2881 mSDsluCounter, 4150 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2881 SdHoareTripleChecker+Valid, 5470 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:01,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2881 Valid, 5470 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2022-01-11 01:49:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 2921. [2022-01-11 01:49:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2918 states have (on average 1.3478409869773817) internal successors, (3933), 2920 states have internal predecessors, (3933), 0 states have call successors, (0), 0 states have 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,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 3933 transitions. [2022-01-11 01:49:01,683 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 3933 transitions. Word has length 53 [2022-01-11 01:49:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:01,683 INFO L470 AbstractCegarLoop]: Abstraction has 2921 states and 3933 transitions. [2022-01-11 01:49:01,684 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:49:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 3933 transitions. [2022-01-11 01:49:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:49:01,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:01,685 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:49:01,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 01:49:01,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:49:01,902 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:49:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 477574019, now seen corresponding path program 2 times [2022-01-11 01:49:01,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:01,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544438436] [2022-01-11 01:49:01,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:01,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:01,931 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:49:01,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:01,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544438436] [2022-01-11 01:49:01,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544438436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:01,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:01,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:01,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724630812] [2022-01-11 01:49:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:01,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:01,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:01,935 INFO L87 Difference]: Start difference. First operand 2921 states and 3933 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:49:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:02,057 INFO L93 Difference]: Finished difference Result 4015 states and 5378 transitions. [2022-01-11 01:49:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:02,058 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:49:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:02,064 INFO L225 Difference]: With dead ends: 4015 [2022-01-11 01:49:02,064 INFO L226 Difference]: Without dead ends: 2275 [2022-01-11 01:49:02,066 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:02,067 INFO L933 BasicCegarLoop]: 1232 mSDtfsCounter, 1115 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1348 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:49:02,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1115 Valid, 1348 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2022-01-11 01:49:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2259. [2022-01-11 01:49:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2256 states have (on average 1.3426418439716312) internal successors, (3029), 2258 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have 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,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3029 transitions. [2022-01-11 01:49:02,207 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3029 transitions. Word has length 56 [2022-01-11 01:49:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:02,207 INFO L470 AbstractCegarLoop]: Abstraction has 2259 states and 3029 transitions. [2022-01-11 01:49:02,207 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:49:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3029 transitions. [2022-01-11 01:49:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 01:49:02,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:02,208 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:49:02,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:49:02,209 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:49:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash 314711327, now seen corresponding path program 1 times [2022-01-11 01:49:02,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:02,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650148911] [2022-01-11 01:49:02,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:02,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:02,242 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:49:02,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:02,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650148911] [2022-01-11 01:49:02,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650148911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:02,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:02,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:02,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875150304] [2022-01-11 01:49:02,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:02,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:02,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:02,244 INFO L87 Difference]: Start difference. First operand 2259 states and 3029 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:49:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:02,422 INFO L93 Difference]: Finished difference Result 4746 states and 6177 transitions. [2022-01-11 01:49:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:02,423 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:49:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:02,430 INFO L225 Difference]: With dead ends: 4746 [2022-01-11 01:49:02,430 INFO L226 Difference]: Without dead ends: 2644 [2022-01-11 01:49:02,433 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:02,433 INFO L933 BasicCegarLoop]: 1255 mSDtfsCounter, 89 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 2406 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:49:02,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 2406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2022-01-11 01:49:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2022-01-11 01:49:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2641 states have (on average 1.3207118515713745) internal successors, (3488), 2643 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have 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,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3488 transitions. [2022-01-11 01:49:02,578 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3488 transitions. Word has length 60 [2022-01-11 01:49:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:02,578 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3488 transitions. [2022-01-11 01:49:02,578 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:49:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3488 transitions. [2022-01-11 01:49:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 01:49:02,580 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:02,580 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:49:02,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:49:02,580 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:49:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash 311515801, now seen corresponding path program 1 times [2022-01-11 01:49:02,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816476997] [2022-01-11 01:49:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:02,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:02,622 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:49:02,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:02,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816476997] [2022-01-11 01:49:02,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816476997] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:02,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:02,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:02,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577283390] [2022-01-11 01:49:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:02,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:02,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:02,624 INFO L87 Difference]: Start difference. First operand 2644 states and 3488 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:49:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:02,762 INFO L93 Difference]: Finished difference Result 4507 states and 5840 transitions. [2022-01-11 01:49:02,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:02,762 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:49:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:02,768 INFO L225 Difference]: With dead ends: 4507 [2022-01-11 01:49:02,768 INFO L226 Difference]: Without dead ends: 2644 [2022-01-11 01:49:02,770 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:02,771 INFO L933 BasicCegarLoop]: 1164 mSDtfsCounter, 1107 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1248 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:49:02,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 1248 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2022-01-11 01:49:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2022-01-11 01:49:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2641 states have (on average 1.3055660734570238) internal successors, (3448), 2643 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have 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,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3448 transitions. [2022-01-11 01:49:02,896 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3448 transitions. Word has length 68 [2022-01-11 01:49:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:02,897 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3448 transitions. [2022-01-11 01:49:02,897 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:49:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3448 transitions. [2022-01-11 01:49:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 01:49:02,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:02,898 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:49:02,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:49:02,898 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1638082592, now seen corresponding path program 1 times [2022-01-11 01:49:02,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:02,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999191093] [2022-01-11 01:49:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:02,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:02,922 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:49:02,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999191093] [2022-01-11 01:49:02,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999191093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:02,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:02,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:02,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157525244] [2022-01-11 01:49:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:02,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:02,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:02,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:02,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:02,923 INFO L87 Difference]: Start difference. First operand 2644 states and 3448 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:49:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:03,085 INFO L93 Difference]: Finished difference Result 3943 states and 5082 transitions. [2022-01-11 01:49:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:03,086 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:49:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:03,090 INFO L225 Difference]: With dead ends: 3943 [2022-01-11 01:49:03,090 INFO L226 Difference]: Without dead ends: 2318 [2022-01-11 01:49:03,092 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:03,092 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 99 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2393 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:49:03,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 2393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-01-11 01:49:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2316. [2022-01-11 01:49:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2313 states have (on average 1.3030696065715521) internal successors, (3014), 2315 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3014 transitions. [2022-01-11 01:49:03,205 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3014 transitions. Word has length 69 [2022-01-11 01:49:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:03,205 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 3014 transitions. [2022-01-11 01:49:03,205 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:49:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3014 transitions. [2022-01-11 01:49:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:03,207 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:03,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:03,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:49:03,207 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:49:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1658446586, now seen corresponding path program 1 times [2022-01-11 01:49:03,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:03,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68565385] [2022-01-11 01:49:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:03,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:03,229 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:49:03,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:03,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68565385] [2022-01-11 01:49:03,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68565385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:03,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:03,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:03,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292738902] [2022-01-11 01:49:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:03,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:03,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:03,231 INFO L87 Difference]: Start difference. First operand 2316 states and 3014 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:49:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:03,328 INFO L93 Difference]: Finished difference Result 2996 states and 4031 transitions. [2022-01-11 01:49:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:03,329 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 99 [2022-01-11 01:49:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:03,332 INFO L225 Difference]: With dead ends: 2996 [2022-01-11 01:49:03,332 INFO L226 Difference]: Without dead ends: 2316 [2022-01-11 01:49:03,333 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:03,334 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 1023 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1291 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:49:03,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1023 Valid, 1291 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2022-01-11 01:49:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2316. [2022-01-11 01:49:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2313 states have (on average 1.3026372676178124) internal successors, (3013), 2315 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have 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,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3013 transitions. [2022-01-11 01:49:03,452 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3013 transitions. Word has length 99 [2022-01-11 01:49:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:03,453 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 3013 transitions. [2022-01-11 01:49:03,453 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:49:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3013 transitions. [2022-01-11 01:49:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:03,454 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:03,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:03,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:49:03,455 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:49:03,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1273079803, now seen corresponding path program 1 times [2022-01-11 01:49:03,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:03,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775285379] [2022-01-11 01:49:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:03,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:03,478 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:49:03,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:03,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775285379] [2022-01-11 01:49:03,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775285379] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:03,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:03,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:03,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555772851] [2022-01-11 01:49:03,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:03,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:03,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:03,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:03,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:03,479 INFO L87 Difference]: Start difference. First operand 2316 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:03,603 INFO L93 Difference]: Finished difference Result 3541 states and 4838 transitions. [2022-01-11 01:49:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:03,607 INFO L225 Difference]: With dead ends: 3541 [2022-01-11 01:49:03,607 INFO L226 Difference]: Without dead ends: 2864 [2022-01-11 01:49:03,608 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:03,609 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 1071 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 2035 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:49:03,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1071 Valid, 2035 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2022-01-11 01:49:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2860. [2022-01-11 01:49:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.337066853342667) internal successors, (3820), 2859 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3820 transitions. [2022-01-11 01:49:03,728 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3820 transitions. Word has length 99 [2022-01-11 01:49:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:03,728 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3820 transitions. [2022-01-11 01:49:03,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3820 transitions. [2022-01-11 01:49:03,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:03,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:03,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:03,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:49:03,731 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:49:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash 588218149, now seen corresponding path program 1 times [2022-01-11 01:49:03,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:03,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343275101] [2022-01-11 01:49:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:03,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:03,754 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:49:03,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:03,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343275101] [2022-01-11 01:49:03,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343275101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:03,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:03,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:03,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671445135] [2022-01-11 01:49:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:03,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:03,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:03,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:03,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:03,756 INFO L87 Difference]: Start difference. First operand 2860 states and 3820 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:03,904 INFO L93 Difference]: Finished difference Result 4080 states and 5638 transitions. [2022-01-11 01:49:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:03,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:03,909 INFO L225 Difference]: With dead ends: 4080 [2022-01-11 01:49:03,909 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:03,911 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:03,911 INFO L933 BasicCegarLoop]: 1150 mSDtfsCounter, 1141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1150 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:49:03,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 1150 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3342667133356667) internal successors, (3812), 2859 states have internal predecessors, (3812), 0 states have call successors, (0), 0 states have 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:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3812 transitions. [2022-01-11 01:49:04,033 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3812 transitions. Word has length 99 [2022-01-11 01:49:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:04,033 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3812 transitions. [2022-01-11 01:49:04,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3812 transitions. [2022-01-11 01:49:04,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:04,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:04,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:04,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:49:04,036 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:49:04,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash -875760635, now seen corresponding path program 1 times [2022-01-11 01:49:04,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:04,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278965772] [2022-01-11 01:49:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:04,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:04,059 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:49:04,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278965772] [2022-01-11 01:49:04,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278965772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:04,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:04,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:04,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431864847] [2022-01-11 01:49:04,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:04,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:04,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:04,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:04,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:04,060 INFO L87 Difference]: Start difference. First operand 2860 states and 3812 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:04,190 INFO L93 Difference]: Finished difference Result 4079 states and 5621 transitions. [2022-01-11 01:49:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:04,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:04,195 INFO L225 Difference]: With dead ends: 4079 [2022-01-11 01:49:04,195 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:04,197 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:04,197 INFO L933 BasicCegarLoop]: 1145 mSDtfsCounter, 1135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1145 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:49:04,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1135 Valid, 1145 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3314665733286664) internal successors, (3804), 2859 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have 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:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3804 transitions. [2022-01-11 01:49:04,350 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3804 transitions. Word has length 99 [2022-01-11 01:49:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:04,350 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3804 transitions. [2022-01-11 01:49:04,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3804 transitions. [2022-01-11 01:49:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:04,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:04,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:04,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:49:04,353 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:49:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1293771557, now seen corresponding path program 1 times [2022-01-11 01:49:04,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:04,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585521924] [2022-01-11 01:49:04,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:04,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:04,383 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:49:04,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:04,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585521924] [2022-01-11 01:49:04,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585521924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:04,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:04,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:04,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988359] [2022-01-11 01:49:04,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:04,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:04,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:04,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:04,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:04,385 INFO L87 Difference]: Start difference. First operand 2860 states and 3804 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:04,528 INFO L93 Difference]: Finished difference Result 4078 states and 5604 transitions. [2022-01-11 01:49:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:04,533 INFO L225 Difference]: With dead ends: 4078 [2022-01-11 01:49:04,533 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:04,535 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:04,535 INFO L933 BasicCegarLoop]: 1140 mSDtfsCounter, 1129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:04,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 1140 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.328666433321666) internal successors, (3796), 2859 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have 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:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3796 transitions. [2022-01-11 01:49:04,716 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3796 transitions. Word has length 99 [2022-01-11 01:49:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:04,716 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3796 transitions. [2022-01-11 01:49:04,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3796 transitions. [2022-01-11 01:49:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:04,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:04,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:49:04,719 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:49:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -160264187, now seen corresponding path program 1 times [2022-01-11 01:49:04,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:04,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381160161] [2022-01-11 01:49:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:04,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:49:04,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:04,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381160161] [2022-01-11 01:49:04,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381160161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:04,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:04,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:04,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210922411] [2022-01-11 01:49:04,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:04,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:04,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:04,752 INFO L87 Difference]: Start difference. First operand 2860 states and 3796 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:04,922 INFO L93 Difference]: Finished difference Result 4077 states and 5587 transitions. [2022-01-11 01:49:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:04,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:04,927 INFO L225 Difference]: With dead ends: 4077 [2022-01-11 01:49:04,927 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:04,928 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:04,929 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 1123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:04,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1123 Valid, 1135 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3258662933146657) internal successors, (3788), 2859 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have 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,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3788 transitions. [2022-01-11 01:49:05,063 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3788 transitions. Word has length 99 [2022-01-11 01:49:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:05,064 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3788 transitions. [2022-01-11 01:49:05,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3788 transitions. [2022-01-11 01:49:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:05,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:05,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:05,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:49:05,066 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:49:05,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:05,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1454094555, now seen corresponding path program 1 times [2022-01-11 01:49:05,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:05,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963343228] [2022-01-11 01:49:05,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:05,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:05,101 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:49:05,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:05,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963343228] [2022-01-11 01:49:05,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963343228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:05,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:05,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:05,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831600744] [2022-01-11 01:49:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:05,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:05,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:05,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:05,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:05,102 INFO L87 Difference]: Start difference. First operand 2860 states and 3788 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:05,264 INFO L93 Difference]: Finished difference Result 4076 states and 5570 transitions. [2022-01-11 01:49:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:05,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:05,275 INFO L225 Difference]: With dead ends: 4076 [2022-01-11 01:49:05,276 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:05,278 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:05,279 INFO L933 BasicCegarLoop]: 1130 mSDtfsCounter, 1117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:05,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1117 Valid, 1130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3230661533076653) internal successors, (3780), 2859 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3780 transitions. [2022-01-11 01:49:05,426 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3780 transitions. Word has length 99 [2022-01-11 01:49:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:05,426 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3780 transitions. [2022-01-11 01:49:05,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3780 transitions. [2022-01-11 01:49:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:05,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:05,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:05,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:49:05,429 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:49:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2050020347, now seen corresponding path program 1 times [2022-01-11 01:49:05,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:05,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213097185] [2022-01-11 01:49:05,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:05,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:05,451 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:49:05,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:05,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213097185] [2022-01-11 01:49:05,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213097185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:05,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:05,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:05,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289681330] [2022-01-11 01:49:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:05,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:05,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:05,453 INFO L87 Difference]: Start difference. First operand 2860 states and 3780 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:05,599 INFO L93 Difference]: Finished difference Result 4075 states and 5553 transitions. [2022-01-11 01:49:05,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:05,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:05,604 INFO L225 Difference]: With dead ends: 4075 [2022-01-11 01:49:05,604 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:05,605 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:05,606 INFO L933 BasicCegarLoop]: 1125 mSDtfsCounter, 1111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:05,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1111 Valid, 1125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.320266013300665) internal successors, (3772), 2859 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have 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,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3772 transitions. [2022-01-11 01:49:05,776 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3772 transitions. Word has length 99 [2022-01-11 01:49:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:05,776 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3772 transitions. [2022-01-11 01:49:05,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3772 transitions. [2022-01-11 01:49:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:05,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:05,778 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:05,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:49:05,778 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:49:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1376507099, now seen corresponding path program 1 times [2022-01-11 01:49:05,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:05,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85281388] [2022-01-11 01:49:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:05,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:05,799 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:49:05,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:05,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85281388] [2022-01-11 01:49:05,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85281388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:05,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:05,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:05,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700365179] [2022-01-11 01:49:05,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:05,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:05,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:05,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:05,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:05,800 INFO L87 Difference]: Start difference. First operand 2860 states and 3772 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:05,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:05,964 INFO L93 Difference]: Finished difference Result 4074 states and 5536 transitions. [2022-01-11 01:49:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:05,968 INFO L225 Difference]: With dead ends: 4074 [2022-01-11 01:49:05,968 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:05,969 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:05,970 INFO L933 BasicCegarLoop]: 1102 mSDtfsCounter, 1024 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:05,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 1170 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.311865593279664) internal successors, (3748), 2859 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have 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,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3748 transitions. [2022-01-11 01:49:06,150 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3748 transitions. Word has length 99 [2022-01-11 01:49:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:06,153 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3748 transitions. [2022-01-11 01:49:06,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3748 transitions. [2022-01-11 01:49:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:06,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:06,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:06,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:49:06,155 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:49:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1869661052, now seen corresponding path program 1 times [2022-01-11 01:49:06,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:06,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875395014] [2022-01-11 01:49:06,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:06,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:06,176 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:49:06,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:06,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875395014] [2022-01-11 01:49:06,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875395014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:06,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:06,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:06,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650352467] [2022-01-11 01:49:06,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:06,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:06,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:06,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:06,177 INFO L87 Difference]: Start difference. First operand 2860 states and 3748 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:06,345 INFO L93 Difference]: Finished difference Result 4073 states and 5487 transitions. [2022-01-11 01:49:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:06,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:06,350 INFO L225 Difference]: With dead ends: 4073 [2022-01-11 01:49:06,350 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:06,352 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:06,352 INFO L933 BasicCegarLoop]: 1088 mSDtfsCounter, 1010 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:06,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1010 Valid, 1155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3034651732586628) internal successors, (3724), 2859 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have 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,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3724 transitions. [2022-01-11 01:49:06,507 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3724 transitions. Word has length 99 [2022-01-11 01:49:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:06,507 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3724 transitions. [2022-01-11 01:49:06,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3724 transitions. [2022-01-11 01:49:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:06,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:06,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:06,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:49:06,509 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:06,509 INFO L85 PathProgramCache]: Analyzing trace with hash 11207523, now seen corresponding path program 1 times [2022-01-11 01:49:06,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:06,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290995451] [2022-01-11 01:49:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:06,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:06,530 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:49:06,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290995451] [2022-01-11 01:49:06,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290995451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:06,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:06,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:06,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733980395] [2022-01-11 01:49:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:06,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:06,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:06,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:06,532 INFO L87 Difference]: Start difference. First operand 2860 states and 3724 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:06,774 INFO L93 Difference]: Finished difference Result 4072 states and 5438 transitions. [2022-01-11 01:49:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:06,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:06,779 INFO L225 Difference]: With dead ends: 4072 [2022-01-11 01:49:06,779 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:06,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:06,782 INFO L933 BasicCegarLoop]: 1074 mSDtfsCounter, 996 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:06,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [996 Valid, 1140 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2950647532376618) internal successors, (3700), 2859 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3700 transitions. [2022-01-11 01:49:07,002 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3700 transitions. Word has length 99 [2022-01-11 01:49:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:07,002 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3700 transitions. [2022-01-11 01:49:07,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3700 transitions. [2022-01-11 01:49:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:07,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:07,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:07,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:49:07,004 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash 329995074, now seen corresponding path program 1 times [2022-01-11 01:49:07,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:07,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972725003] [2022-01-11 01:49:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:07,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:07,027 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:49:07,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:07,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972725003] [2022-01-11 01:49:07,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972725003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:07,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:07,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:07,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312023886] [2022-01-11 01:49:07,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:07,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:07,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:07,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:07,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:07,029 INFO L87 Difference]: Start difference. First operand 2860 states and 3700 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:07,240 INFO L93 Difference]: Finished difference Result 4071 states and 5389 transitions. [2022-01-11 01:49:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:07,245 INFO L225 Difference]: With dead ends: 4071 [2022-01-11 01:49:07,245 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:07,246 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:07,246 INFO L933 BasicCegarLoop]: 1060 mSDtfsCounter, 982 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:07,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 1125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2866643332166607) internal successors, (3676), 2859 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3676 transitions. [2022-01-11 01:49:07,407 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3676 transitions. Word has length 99 [2022-01-11 01:49:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:07,407 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3676 transitions. [2022-01-11 01:49:07,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3676 transitions. [2022-01-11 01:49:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:07,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:07,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:07,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:49:07,410 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:49:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 207145121, now seen corresponding path program 1 times [2022-01-11 01:49:07,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:07,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332550922] [2022-01-11 01:49:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:07,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:07,430 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:49:07,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:07,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332550922] [2022-01-11 01:49:07,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332550922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:07,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:07,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:07,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886366263] [2022-01-11 01:49:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:07,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:07,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:07,432 INFO L87 Difference]: Start difference. First operand 2860 states and 3676 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:07,641 INFO L93 Difference]: Finished difference Result 4070 states and 5340 transitions. [2022-01-11 01:49:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:07,645 INFO L225 Difference]: With dead ends: 4070 [2022-01-11 01:49:07,645 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:07,647 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:07,648 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 968 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:07,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [968 Valid, 1110 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2782639131956597) internal successors, (3652), 2859 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3652 transitions. [2022-01-11 01:49:07,812 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3652 transitions. Word has length 99 [2022-01-11 01:49:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:07,812 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3652 transitions. [2022-01-11 01:49:07,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3652 transitions. [2022-01-11 01:49:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:07,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:07,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:07,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:49:07,814 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:49:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash -318630144, now seen corresponding path program 1 times [2022-01-11 01:49:07,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:07,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15741604] [2022-01-11 01:49:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:07,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:07,834 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:49:07,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:07,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15741604] [2022-01-11 01:49:07,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15741604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:07,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:07,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:07,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461442187] [2022-01-11 01:49:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:07,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:07,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:07,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:07,836 INFO L87 Difference]: Start difference. First operand 2860 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:08,026 INFO L93 Difference]: Finished difference Result 4069 states and 5291 transitions. [2022-01-11 01:49:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:08,032 INFO L225 Difference]: With dead ends: 4069 [2022-01-11 01:49:08,032 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:08,033 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:08,034 INFO L933 BasicCegarLoop]: 1032 mSDtfsCounter, 954 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:08,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [954 Valid, 1095 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2698634931746586) internal successors, (3628), 2859 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have 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:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3628 transitions. [2022-01-11 01:49:08,242 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3628 transitions. Word has length 99 [2022-01-11 01:49:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:08,242 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3628 transitions. [2022-01-11 01:49:08,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3628 transitions. [2022-01-11 01:49:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:08,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:08,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:08,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:49:08,245 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:49:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1829176609, now seen corresponding path program 1 times [2022-01-11 01:49:08,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:08,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049870466] [2022-01-11 01:49:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:08,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:08,267 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:49:08,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:08,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049870466] [2022-01-11 01:49:08,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049870466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:08,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:08,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:08,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813053071] [2022-01-11 01:49:08,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:08,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:08,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:08,269 INFO L87 Difference]: Start difference. First operand 2860 states and 3628 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:08,462 INFO L93 Difference]: Finished difference Result 4068 states and 5242 transitions. [2022-01-11 01:49:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:08,467 INFO L225 Difference]: With dead ends: 4068 [2022-01-11 01:49:08,467 INFO L226 Difference]: Without dead ends: 2860 [2022-01-11 01:49:08,469 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:08,469 INFO L933 BasicCegarLoop]: 1018 mSDtfsCounter, 940 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:08,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 1080 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-11 01:49:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-11 01:49:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2614630731536576) internal successors, (3604), 2859 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3604 transitions. [2022-01-11 01:49:08,655 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3604 transitions. Word has length 99 [2022-01-11 01:49:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:08,655 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3604 transitions. [2022-01-11 01:49:08,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3604 transitions. [2022-01-11 01:49:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:08,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:08,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:08,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:49:08,657 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:49:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash 481232830, now seen corresponding path program 1 times [2022-01-11 01:49:08,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:08,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094923594] [2022-01-11 01:49:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:08,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:08,700 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:49:08,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:08,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094923594] [2022-01-11 01:49:08,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094923594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:08,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:08,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:08,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028947953] [2022-01-11 01:49:08,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:08,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:08,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:08,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:08,702 INFO L87 Difference]: Start difference. First operand 2860 states and 3604 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:09,033 INFO L93 Difference]: Finished difference Result 4607 states and 5948 transitions. [2022-01-11 01:49:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:09,037 INFO L225 Difference]: With dead ends: 4607 [2022-01-11 01:49:09,037 INFO L226 Difference]: Without dead ends: 3406 [2022-01-11 01:49:09,039 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:49:09,040 INFO L933 BasicCegarLoop]: 1108 mSDtfsCounter, 2522 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:09,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2522 Valid, 2622 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2022-01-11 01:49:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 2866. [2022-01-11 01:49:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2863 states have (on average 1.2553265805099545) internal successors, (3594), 2865 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 3594 transitions. [2022-01-11 01:49:09,229 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 3594 transitions. Word has length 99 [2022-01-11 01:49:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:09,229 INFO L470 AbstractCegarLoop]: Abstraction has 2866 states and 3594 transitions. [2022-01-11 01:49:09,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 3594 transitions. [2022-01-11 01:49:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:09,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:09,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:09,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:49:09,231 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:49:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -126844033, now seen corresponding path program 1 times [2022-01-11 01:49:09,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:09,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453687485] [2022-01-11 01:49:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:09,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:09,271 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:49:09,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:09,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453687485] [2022-01-11 01:49:09,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453687485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:09,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:09,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:09,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489310533] [2022-01-11 01:49:09,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:09,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:09,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:09,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:09,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:09,273 INFO L87 Difference]: Start difference. First operand 2866 states and 3594 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:09,560 INFO L93 Difference]: Finished difference Result 4779 states and 6123 transitions. [2022-01-11 01:49:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:09,564 INFO L225 Difference]: With dead ends: 4779 [2022-01-11 01:49:09,565 INFO L226 Difference]: Without dead ends: 3586 [2022-01-11 01:49:09,566 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:49:09,567 INFO L933 BasicCegarLoop]: 1063 mSDtfsCounter, 2288 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:09,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2288 Valid, 2988 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2022-01-11 01:49:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 2872. [2022-01-11 01:49:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2869 states have (on average 1.249215754618334) internal successors, (3584), 2871 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states have 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,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 3584 transitions. [2022-01-11 01:49:09,832 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 3584 transitions. Word has length 99 [2022-01-11 01:49:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:09,833 INFO L470 AbstractCegarLoop]: Abstraction has 2872 states and 3584 transitions. [2022-01-11 01:49:09,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 3584 transitions. [2022-01-11 01:49:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:09,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:09,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:49:09,836 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:49:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 566548672, now seen corresponding path program 1 times [2022-01-11 01:49:09,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086974568] [2022-01-11 01:49:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:09,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:09,886 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:49:09,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086974568] [2022-01-11 01:49:09,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086974568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:09,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:09,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:49:09,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620504614] [2022-01-11 01:49:09,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:09,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:49:09,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:09,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:49:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:49:09,887 INFO L87 Difference]: Start difference. First operand 2872 states and 3584 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:10,296 INFO L93 Difference]: Finished difference Result 4874 states and 6197 transitions. [2022-01-11 01:49:10,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:49:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:10,301 INFO L225 Difference]: With dead ends: 4874 [2022-01-11 01:49:10,301 INFO L226 Difference]: Without dead ends: 3682 [2022-01-11 01:49:10,303 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:49:10,304 INFO L933 BasicCegarLoop]: 1036 mSDtfsCounter, 2163 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2163 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:10,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2163 Valid, 3146 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:49:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2022-01-11 01:49:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 2878. [2022-01-11 01:49:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2875 states have (on average 1.2431304347826087) internal successors, (3574), 2877 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have 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,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3574 transitions. [2022-01-11 01:49:10,580 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3574 transitions. Word has length 99 [2022-01-11 01:49:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:10,580 INFO L470 AbstractCegarLoop]: Abstraction has 2878 states and 3574 transitions. [2022-01-11 01:49:10,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3574 transitions. [2022-01-11 01:49:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-11 01:49:10,582 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:10,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:10,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:49:10,582 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:49:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash 558789313, now seen corresponding path program 1 times [2022-01-11 01:49:10,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:10,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492078937] [2022-01-11 01:49:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:10,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:10,614 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:49:10,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:10,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492078937] [2022-01-11 01:49:10,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492078937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:10,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:10,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:10,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814219988] [2022-01-11 01:49:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:10,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:10,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:10,615 INFO L87 Difference]: Start difference. First operand 2878 states and 3574 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:10,917 INFO L93 Difference]: Finished difference Result 5219 states and 6557 transitions. [2022-01-11 01:49:10,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:10,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-11 01:49:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:10,922 INFO L225 Difference]: With dead ends: 5219 [2022-01-11 01:49:10,923 INFO L226 Difference]: Without dead ends: 3995 [2022-01-11 01:49:10,925 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:10,925 INFO L933 BasicCegarLoop]: 992 mSDtfsCounter, 869 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:10,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 1736 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2022-01-11 01:49:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3899. [2022-01-11 01:49:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3899 states, 3896 states have (on average 1.2476899383983573) internal successors, (4861), 3898 states have internal predecessors, (4861), 0 states have call successors, (0), 0 states have 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:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 4861 transitions. [2022-01-11 01:49:11,241 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 4861 transitions. Word has length 99 [2022-01-11 01:49:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:11,241 INFO L470 AbstractCegarLoop]: Abstraction has 3899 states and 4861 transitions. [2022-01-11 01:49:11,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 4861 transitions. [2022-01-11 01:49:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 01:49:11,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:11,243 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:11,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:49:11,243 INFO L402 AbstractCegarLoop]: === Iteration 33 === 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:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash 228926803, now seen corresponding path program 1 times [2022-01-11 01:49:11,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:11,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333255231] [2022-01-11 01:49:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:11,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 01:49:11,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:11,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333255231] [2022-01-11 01:49:11,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333255231] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:11,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:11,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:49:11,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069518950] [2022-01-11 01:49:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:11,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:11,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,263 INFO L87 Difference]: Start difference. First operand 3899 states and 4861 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:11,568 INFO L93 Difference]: Finished difference Result 5543 states and 6965 transitions. [2022-01-11 01:49:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:11,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-11 01:49:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:11,573 INFO L225 Difference]: With dead ends: 5543 [2022-01-11 01:49:11,573 INFO L226 Difference]: Without dead ends: 4175 [2022-01-11 01:49:11,575 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:11,575 INFO L933 BasicCegarLoop]: 998 mSDtfsCounter, 978 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1086 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:11,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 1086 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:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2022-01-11 01:49:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 4136. [2022-01-11 01:49:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4133 states have (on average 1.2579240261311395) internal successors, (5199), 4135 states have internal predecessors, (5199), 0 states have call successors, (0), 0 states have 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:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 5199 transitions. [2022-01-11 01:49:11,869 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 5199 transitions. Word has length 100 [2022-01-11 01:49:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:11,869 INFO L470 AbstractCegarLoop]: Abstraction has 4136 states and 5199 transitions. [2022-01-11 01:49:11,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 5199 transitions. [2022-01-11 01:49:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:11,870 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:11,870 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:11,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:49:11,871 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:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1263786758, now seen corresponding path program 1 times [2022-01-11 01:49:11,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:11,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756127027] [2022-01-11 01:49:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:11,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:11,899 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:11,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:11,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756127027] [2022-01-11 01:49:11,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756127027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:11,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:11,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:11,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642075350] [2022-01-11 01:49:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:11,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:11,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:11,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:11,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:11,900 INFO L87 Difference]: Start difference. First operand 4136 states and 5199 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:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:12,239 INFO L93 Difference]: Finished difference Result 5745 states and 7244 transitions. [2022-01-11 01:49:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:12,240 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:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,244 INFO L225 Difference]: With dead ends: 5745 [2022-01-11 01:49:12,244 INFO L226 Difference]: Without dead ends: 4144 [2022-01-11 01:49:12,246 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,246 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 69 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1862 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:12,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1862 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:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2022-01-11 01:49:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 4144. [2022-01-11 01:49:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4141 states have (on average 1.2511470659261048) internal successors, (5181), 4143 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have 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,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5181 transitions. [2022-01-11 01:49:12,542 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5181 transitions. Word has length 110 [2022-01-11 01:49:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:12,542 INFO L470 AbstractCegarLoop]: Abstraction has 4144 states and 5181 transitions. [2022-01-11 01:49:12,543 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:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5181 transitions. [2022-01-11 01:49:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:49:12,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:12,544 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:12,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:49:12,544 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:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1023246629, now seen corresponding path program 1 times [2022-01-11 01:49:12,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:12,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814347186] [2022-01-11 01:49:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:12,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:12,573 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:12,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:12,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814347186] [2022-01-11 01:49:12,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814347186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:12,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:12,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:12,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646528855] [2022-01-11 01:49:12,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:12,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:12,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:12,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:12,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:12,575 INFO L87 Difference]: Start difference. First operand 4144 states and 5181 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:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:12,826 INFO L93 Difference]: Finished difference Result 4907 states and 6139 transitions. [2022-01-11 01:49:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:12,827 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:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:12,832 INFO L225 Difference]: With dead ends: 4907 [2022-01-11 01:49:12,832 INFO L226 Difference]: Without dead ends: 3298 [2022-01-11 01:49:12,835 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,836 INFO L933 BasicCegarLoop]: 989 mSDtfsCounter, 951 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1010 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:12,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [951 Valid, 1010 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:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2022-01-11 01:49:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2022-01-11 01:49:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 3295 states have (on average 1.243702579666161) internal successors, (4098), 3297 states have internal predecessors, (4098), 0 states have call successors, (0), 0 states have 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,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4098 transitions. [2022-01-11 01:49:13,089 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4098 transitions. Word has length 110 [2022-01-11 01:49:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:13,089 INFO L470 AbstractCegarLoop]: Abstraction has 3298 states and 4098 transitions. [2022-01-11 01:49:13,089 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:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4098 transitions. [2022-01-11 01:49:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:49:13,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:13,091 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:13,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:49:13,091 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:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash -697741496, now seen corresponding path program 1 times [2022-01-11 01:49:13,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:13,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428060862] [2022-01-11 01:49:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 01:49:13,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:13,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428060862] [2022-01-11 01:49:13,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428060862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:13,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:13,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:13,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624378887] [2022-01-11 01:49:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:13,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:13,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:13,132 INFO L87 Difference]: Start difference. First operand 3298 states and 4098 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:49:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:13,399 INFO L93 Difference]: Finished difference Result 4070 states and 5042 transitions. [2022-01-11 01:49:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:13,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-11 01:49:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:13,404 INFO L225 Difference]: With dead ends: 4070 [2022-01-11 01:49:13,404 INFO L226 Difference]: Without dead ends: 3307 [2022-01-11 01:49:13,406 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:13,406 INFO L933 BasicCegarLoop]: 988 mSDtfsCounter, 60 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1866 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:13,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1866 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:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2022-01-11 01:49:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3307. [2022-01-11 01:49:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 3304 states have (on average 1.2388014527845037) internal successors, (4093), 3306 states have internal predecessors, (4093), 0 states have call successors, (0), 0 states have 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,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4093 transitions. [2022-01-11 01:49:13,661 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4093 transitions. Word has length 113 [2022-01-11 01:49:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:13,662 INFO L470 AbstractCegarLoop]: Abstraction has 3307 states and 4093 transitions. [2022-01-11 01:49:13,662 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:49:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4093 transitions. [2022-01-11 01:49:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:49:13,663 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:13,663 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:13,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:49:13,663 INFO L402 AbstractCegarLoop]: === Iteration 37 === 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:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1146438135, now seen corresponding path program 1 times [2022-01-11 01:49:13,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339914437] [2022-01-11 01:49:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:13,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 01:49:13,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:13,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339914437] [2022-01-11 01:49:13,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339914437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:13,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:13,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:13,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815091346] [2022-01-11 01:49:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:13,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:13,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:13,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:13,695 INFO L87 Difference]: Start difference. First operand 3307 states and 4093 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:49:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:13,917 INFO L93 Difference]: Finished difference Result 3702 states and 4556 transitions. [2022-01-11 01:49:13,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-11 01:49:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:13,920 INFO L225 Difference]: With dead ends: 3702 [2022-01-11 01:49:13,921 INFO L226 Difference]: Without dead ends: 2274 [2022-01-11 01:49:13,922 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:13,923 INFO L933 BasicCegarLoop]: 985 mSDtfsCounter, 936 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1003 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:13,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 1003 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:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-01-11 01:49:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2274. [2022-01-11 01:49:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2272 states have (on average 1.2680457746478873) internal successors, (2881), 2273 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have 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,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 2881 transitions. [2022-01-11 01:49:14,078 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 2881 transitions. Word has length 113 [2022-01-11 01:49:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:14,078 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 2881 transitions. [2022-01-11 01:49:14,078 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:49:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2881 transitions. [2022-01-11 01:49:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 01:49:14,079 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:14,079 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:14,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:49:14,080 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:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1973880116, now seen corresponding path program 1 times [2022-01-11 01:49:14,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:14,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063595717] [2022-01-11 01:49:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:14,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:14,113 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:14,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:14,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063595717] [2022-01-11 01:49:14,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063595717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:14,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:14,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:14,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170216978] [2022-01-11 01:49:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:14,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:14,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:14,114 INFO L87 Difference]: Start difference. First operand 2274 states and 2881 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:14,461 INFO L93 Difference]: Finished difference Result 6625 states and 8415 transitions. [2022-01-11 01:49:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:14,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-11 01:49:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:14,466 INFO L225 Difference]: With dead ends: 6625 [2022-01-11 01:49:14,467 INFO L226 Difference]: Without dead ends: 4386 [2022-01-11 01:49:14,469 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,469 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 769 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:14,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 1604 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2022-01-11 01:49:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4198. [2022-01-11 01:49:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 4196 states have (on average 1.2662059103908485) internal successors, (5313), 4197 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have 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,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5313 transitions. [2022-01-11 01:49:14,773 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5313 transitions. Word has length 160 [2022-01-11 01:49:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:14,774 INFO L470 AbstractCegarLoop]: Abstraction has 4198 states and 5313 transitions. [2022-01-11 01:49:14,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5313 transitions. [2022-01-11 01:49:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 01:49:14,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:14,775 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:14,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:49:14,775 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:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash -566757331, now seen corresponding path program 1 times [2022-01-11 01:49:14,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:14,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485906022] [2022-01-11 01:49:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:14,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:14,821 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:14,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:14,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485906022] [2022-01-11 01:49:14,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485906022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:14,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:14,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:14,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467127302] [2022-01-11 01:49:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:14,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:14,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:14,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:14,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:14,823 INFO L87 Difference]: Start difference. First operand 4198 states and 5313 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:15,406 INFO L93 Difference]: Finished difference Result 12295 states and 15473 transitions. [2022-01-11 01:49:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:15,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-11 01:49:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:15,415 INFO L225 Difference]: With dead ends: 12295 [2022-01-11 01:49:15,415 INFO L226 Difference]: Without dead ends: 8187 [2022-01-11 01:49:15,420 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:15,421 INFO L933 BasicCegarLoop]: 1038 mSDtfsCounter, 769 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:15,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 1880 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2022-01-11 01:49:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8015. [2022-01-11 01:49:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 8013 states have (on average 1.2508423811306626) internal successors, (10023), 8014 states have internal predecessors, (10023), 0 states have call successors, (0), 0 states have 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,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 10023 transitions. [2022-01-11 01:49:16,035 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 10023 transitions. Word has length 160 [2022-01-11 01:49:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:16,035 INFO L470 AbstractCegarLoop]: Abstraction has 8015 states and 10023 transitions. [2022-01-11 01:49:16,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 10023 transitions. [2022-01-11 01:49:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 01:49:16,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:16,039 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:16,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:49:16,039 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1019057354, now seen corresponding path program 1 times [2022-01-11 01:49:16,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779144689] [2022-01-11 01:49:16,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:16,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:16,062 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:49:16,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:16,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779144689] [2022-01-11 01:49:16,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779144689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:16,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:16,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:16,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38692198] [2022-01-11 01:49:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:16,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:16,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:16,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:16,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:16,064 INFO L87 Difference]: Start difference. First operand 8015 states and 10023 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:16,659 INFO L93 Difference]: Finished difference Result 15908 states and 19904 transitions. [2022-01-11 01:49:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-11 01:49:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:16,668 INFO L225 Difference]: With dead ends: 15908 [2022-01-11 01:49:16,668 INFO L226 Difference]: Without dead ends: 7932 [2022-01-11 01:49:16,674 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:16,674 INFO L933 BasicCegarLoop]: 870 mSDtfsCounter, 865 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:16,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 871 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2022-01-11 01:49:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7932. [2022-01-11 01:49:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7932 states, 7930 states have (on average 1.2517023959646911) internal successors, (9926), 7931 states have internal predecessors, (9926), 0 states have call successors, (0), 0 states have 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,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 9926 transitions. [2022-01-11 01:49:17,245 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 9926 transitions. Word has length 160 [2022-01-11 01:49:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:17,245 INFO L470 AbstractCegarLoop]: Abstraction has 7932 states and 9926 transitions. [2022-01-11 01:49:17,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 9926 transitions. [2022-01-11 01:49:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 01:49:17,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:17,249 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:17,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:49:17,249 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1917694776, now seen corresponding path program 1 times [2022-01-11 01:49:17,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:17,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673443844] [2022-01-11 01:49:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:17,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:17,286 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:17,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:17,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673443844] [2022-01-11 01:49:17,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673443844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:17,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:17,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:17,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065775534] [2022-01-11 01:49:17,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:17,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:17,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:17,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:17,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:17,287 INFO L87 Difference]: Start difference. First operand 7932 states and 9926 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:18,372 INFO L93 Difference]: Finished difference Result 22658 states and 28288 transitions. [2022-01-11 01:49:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-01-11 01:49:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:18,389 INFO L225 Difference]: With dead ends: 22658 [2022-01-11 01:49:18,389 INFO L226 Difference]: Without dead ends: 14816 [2022-01-11 01:49:18,398 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:18,399 INFO L933 BasicCegarLoop]: 1229 mSDtfsCounter, 628 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:18,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 2078 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14816 states. [2022-01-11 01:49:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14816 to 14812. [2022-01-11 01:49:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14812 states, 14810 states have (on average 1.2440243079000675) internal successors, (18424), 14811 states have internal predecessors, (18424), 0 states have call successors, (0), 0 states have 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,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14812 states to 14812 states and 18424 transitions. [2022-01-11 01:49:19,508 INFO L78 Accepts]: Start accepts. Automaton has 14812 states and 18424 transitions. Word has length 161 [2022-01-11 01:49:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:19,509 INFO L470 AbstractCegarLoop]: Abstraction has 14812 states and 18424 transitions. [2022-01-11 01:49:19,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 14812 states and 18424 transitions. [2022-01-11 01:49:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 01:49:19,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:19,514 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:19,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:49:19,514 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:19,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:19,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2071637991, now seen corresponding path program 1 times [2022-01-11 01:49:19,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:19,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7648168] [2022-01-11 01:49:19,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:19,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:19,540 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:49:19,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:19,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7648168] [2022-01-11 01:49:19,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7648168] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:19,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:19,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:19,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339244236] [2022-01-11 01:49:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:19,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:19,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:19,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:19,542 INFO L87 Difference]: Start difference. First operand 14812 states and 18424 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:20,756 INFO L93 Difference]: Finished difference Result 29452 states and 36650 transitions. [2022-01-11 01:49:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:20,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-01-11 01:49:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:20,778 INFO L225 Difference]: With dead ends: 29452 [2022-01-11 01:49:20,778 INFO L226 Difference]: Without dead ends: 14730 [2022-01-11 01:49:20,794 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,794 INFO L933 BasicCegarLoop]: 869 mSDtfsCounter, 863 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 870 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:49:20,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [863 Valid, 870 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2022-01-11 01:49:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 14730. [2022-01-11 01:49:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14730 states, 14728 states have (on average 1.2445002715915263) internal successors, (18329), 14729 states have internal predecessors, (18329), 0 states have call successors, (0), 0 states have 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,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14730 states to 14730 states and 18329 transitions. [2022-01-11 01:49:22,047 INFO L78 Accepts]: Start accepts. Automaton has 14730 states and 18329 transitions. Word has length 161 [2022-01-11 01:49:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:22,047 INFO L470 AbstractCegarLoop]: Abstraction has 14730 states and 18329 transitions. [2022-01-11 01:49:22,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14730 states and 18329 transitions. [2022-01-11 01:49:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 01:49:22,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:22,053 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:22,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:49:22,053 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:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2019497338, now seen corresponding path program 1 times [2022-01-11 01:49:22,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:22,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069947879] [2022-01-11 01:49:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:22,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:22,092 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:22,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:22,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069947879] [2022-01-11 01:49:22,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069947879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:22,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:22,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:22,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681333417] [2022-01-11 01:49:22,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:22,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:22,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:22,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:22,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:22,094 INFO L87 Difference]: Start difference. First operand 14730 states and 18329 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:24,206 INFO L93 Difference]: Finished difference Result 42227 states and 52489 transitions. [2022-01-11 01:49:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-01-11 01:49:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:24,251 INFO L225 Difference]: With dead ends: 42227 [2022-01-11 01:49:24,251 INFO L226 Difference]: Without dead ends: 27587 [2022-01-11 01:49:24,265 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:24,266 INFO L933 BasicCegarLoop]: 1198 mSDtfsCounter, 633 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2045 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:49:24,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 2045 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27587 states. [2022-01-11 01:49:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27587 to 27583. [2022-01-11 01:49:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27583 states, 27581 states have (on average 1.2401653312062653) internal successors, (34205), 27582 states have internal predecessors, (34205), 0 states have call successors, (0), 0 states have 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,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27583 states to 27583 states and 34205 transitions. [2022-01-11 01:49:26,512 INFO L78 Accepts]: Start accepts. Automaton has 27583 states and 34205 transitions. Word has length 162 [2022-01-11 01:49:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:26,512 INFO L470 AbstractCegarLoop]: Abstraction has 27583 states and 34205 transitions. [2022-01-11 01:49:26,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27583 states and 34205 transitions. [2022-01-11 01:49:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 01:49:26,521 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:26,521 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:26,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:49:26,522 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:26,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1713862809, now seen corresponding path program 1 times [2022-01-11 01:49:26,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:26,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634378010] [2022-01-11 01:49:26,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:26,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:26,552 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:49:26,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:26,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634378010] [2022-01-11 01:49:26,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634378010] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:26,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:26,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:26,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503080268] [2022-01-11 01:49:26,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:26,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:26,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:26,554 INFO L87 Difference]: Start difference. First operand 27583 states and 34205 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:28,912 INFO L93 Difference]: Finished difference Result 54995 states and 68215 transitions. [2022-01-11 01:49:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:28,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-01-11 01:49:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:28,950 INFO L225 Difference]: With dead ends: 54995 [2022-01-11 01:49:28,950 INFO L226 Difference]: Without dead ends: 27502 [2022-01-11 01:49:28,968 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:28,969 INFO L933 BasicCegarLoop]: 868 mSDtfsCounter, 861 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:28,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 869 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27502 states. [2022-01-11 01:49:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27502 to 27502. [2022-01-11 01:49:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27502 states, 27500 states have (on average 1.2404363636363636) internal successors, (34112), 27501 states have internal predecessors, (34112), 0 states have call successors, (0), 0 states have 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:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27502 states to 27502 states and 34112 transitions. [2022-01-11 01:49:31,218 INFO L78 Accepts]: Start accepts. Automaton has 27502 states and 34112 transitions. Word has length 162 [2022-01-11 01:49:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:31,218 INFO L470 AbstractCegarLoop]: Abstraction has 27502 states and 34112 transitions. [2022-01-11 01:49:31,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27502 states and 34112 transitions. [2022-01-11 01:49:31,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-11 01:49:31,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:31,229 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:31,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:49:31,229 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:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash 806560569, now seen corresponding path program 1 times [2022-01-11 01:49:31,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:31,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045251351] [2022-01-11 01:49:31,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:31,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:31,261 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:31,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045251351] [2022-01-11 01:49:31,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045251351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:31,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:31,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:31,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114011396] [2022-01-11 01:49:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:31,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:31,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:31,262 INFO L87 Difference]: Start difference. First operand 27502 states and 34112 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:35,814 INFO L93 Difference]: Finished difference Result 79926 states and 99118 transitions. [2022-01-11 01:49:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2022-01-11 01:49:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:35,936 INFO L225 Difference]: With dead ends: 79926 [2022-01-11 01:49:35,937 INFO L226 Difference]: Without dead ends: 52514 [2022-01-11 01:49:35,971 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:35,971 INFO L933 BasicCegarLoop]: 1053 mSDtfsCounter, 770 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:35,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1889 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52514 states. [2022-01-11 01:49:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52514 to 51358. [2022-01-11 01:49:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51358 states, 51356 states have (on average 1.2373627229535011) internal successors, (63546), 51357 states have internal predecessors, (63546), 0 states have call successors, (0), 0 states have 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:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51358 states to 51358 states and 63546 transitions. [2022-01-11 01:49:40,745 INFO L78 Accepts]: Start accepts. Automaton has 51358 states and 63546 transitions. Word has length 163 [2022-01-11 01:49:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:40,745 INFO L470 AbstractCegarLoop]: Abstraction has 51358 states and 63546 transitions. [2022-01-11 01:49:40,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 51358 states and 63546 transitions. [2022-01-11 01:49:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-11 01:49:40,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:40,762 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:40,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 01:49:40,762 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1907245210, now seen corresponding path program 1 times [2022-01-11 01:49:40,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:40,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839296809] [2022-01-11 01:49:40,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:40,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:40,816 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:49:40,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:40,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839296809] [2022-01-11 01:49:40,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839296809] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:40,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:40,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:40,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899963148] [2022-01-11 01:49:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:40,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:40,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:40,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:40,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:40,822 INFO L87 Difference]: Start difference. First operand 51358 states and 63546 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:45,528 INFO L93 Difference]: Finished difference Result 102576 states and 126934 transitions. [2022-01-11 01:49:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:45,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2022-01-11 01:49:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:45,602 INFO L225 Difference]: With dead ends: 102576 [2022-01-11 01:49:45,602 INFO L226 Difference]: Without dead ends: 51278 [2022-01-11 01:49:45,637 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:45,638 INFO L933 BasicCegarLoop]: 867 mSDtfsCounter, 859 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:45,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 868 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51278 states. [2022-01-11 01:49:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51278 to 51278. [2022-01-11 01:49:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51278 states, 51276 states have (on average 1.237518527186208) internal successors, (63455), 51277 states have internal predecessors, (63455), 0 states have call successors, (0), 0 states have 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:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51278 states to 51278 states and 63455 transitions. [2022-01-11 01:49:50,195 INFO L78 Accepts]: Start accepts. Automaton has 51278 states and 63455 transitions. Word has length 163 [2022-01-11 01:49:50,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:49:50,195 INFO L470 AbstractCegarLoop]: Abstraction has 51278 states and 63455 transitions. [2022-01-11 01:49:50,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 51278 states and 63455 transitions. [2022-01-11 01:49:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-11 01:49:50,210 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:49:50,210 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:49:50,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-11 01:49:50,210 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:49:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:49:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1505700274, now seen corresponding path program 1 times [2022-01-11 01:49:50,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:49:50,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862562360] [2022-01-11 01:49:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:49:50,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:49:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:49:50,253 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:50,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:49:50,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862562360] [2022-01-11 01:49:50,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862562360] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:49:50,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:49:50,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:49:50,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983580920] [2022-01-11 01:49:50,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:49:50,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:49:50,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:49:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:49:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:49:50,254 INFO L87 Difference]: Start difference. First operand 51278 states and 63455 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:49:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:49:58,782 INFO L93 Difference]: Finished difference Result 147870 states and 182947 transitions. [2022-01-11 01:49:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:49:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-01-11 01:49:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:49:58,942 INFO L225 Difference]: With dead ends: 147870 [2022-01-11 01:49:58,942 INFO L226 Difference]: Without dead ends: 96682 [2022-01-11 01:49:58,985 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:58,985 INFO L933 BasicCegarLoop]: 866 mSDtfsCounter, 772 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:49:58,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 1613 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:49:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96682 states.