/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:11:27,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:11:27,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:11:28,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:11:28,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:11:28,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:11:28,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:11:28,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:11:28,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:11:28,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:11:28,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:11:28,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:11:28,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:11:28,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:11:28,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:11:28,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:11:28,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:11:28,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:11:28,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:11:28,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:11:28,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:11:28,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:11:28,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:11:28,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:11:28,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:11:28,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:11:28,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:11:28,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:11:28,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:11:28,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:11:28,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:11:28,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:11:28,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:11:28,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:11:28,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:11:28,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:11:28,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:11:28,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:11:28,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:11:28,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:11:28,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:11:28,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 14:11:28,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:11:28,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:11:28,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:11:28,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:11:28,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:11:28,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:11:28,136 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:11:28,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:11:28,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:11:28,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:11:28,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:11:28,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:11:28,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:11:28,137 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:11:28,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:11:28,138 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:11:28,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:11:28,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:11:28,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:11:28,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:11:28,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:11:28,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:11:28,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:11:28,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:11:28,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:11:28,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:11:28,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:11:28,140 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:11:28,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:11:28,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:11:28,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:11:28,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:11:28,142 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:11:28,143 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 14:11:28,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:11:28,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:11:28,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:11:28,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:11:28,432 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:11:28,434 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.01.cil-1.c [2022-01-10 14:11:28,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456248d6c/294552bde1f9427bb7d13cba646df192/FLAG9970f2b10 [2022-01-10 14:11:29,091 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:11:29,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-01-10 14:11:29,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456248d6c/294552bde1f9427bb7d13cba646df192/FLAG9970f2b10 [2022-01-10 14:11:29,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456248d6c/294552bde1f9427bb7d13cba646df192 [2022-01-10 14:11:29,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:11:29,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:11:29,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:11:29,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:11:29,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:11:29,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef96f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29, skipping insertion in model container [2022-01-10 14:11:29,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:11:29,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:11:29,709 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.01.cil-1.c[914,927] [2022-01-10 14:11:29,750 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.01.cil-1.c[7115,7128] [2022-01-10 14:11:29,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:11:29,783 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:11:29,794 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.01.cil-1.c[914,927] [2022-01-10 14:11:29,811 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.01.cil-1.c[7115,7128] [2022-01-10 14:11:29,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:11:29,843 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:11:29,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29 WrapperNode [2022-01-10 14:11:29,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:11:29,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:11:29,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:11:29,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:11:29,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,939 INFO L137 Inliner]: procedures = 56, calls = 60, calls flagged for inlining = 55, calls inlined = 65, statements flattened = 706 [2022-01-10 14:11:29,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:11:29,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:11:29,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:11:29,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:11:29,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:29,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:11:30,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:11:30,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:11:30,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:11:30,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (1/1) ... [2022-01-10 14:11:30,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:11:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:11:30,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 14:11:30,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 14:11:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:11:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:11:30,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:11:30,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:11:30,175 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:11:30,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:11:30,701 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:11:30,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:11:30,712 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 14:11:30,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:11:30 BoogieIcfgContainer [2022-01-10 14:11:30,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:11:30,715 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:11:30,715 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:11:30,719 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:11:30,722 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:11:30" (1/1) ... [2022-01-10 14:11:30,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:11:30 BasicIcfg [2022-01-10 14:11:30,896 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:11:30,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:11:30,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:11:30,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:11:30,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:11:29" (1/4) ... [2022-01-10 14:11:30,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b92995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:11:30, skipping insertion in model container [2022-01-10 14:11:30,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:11:29" (2/4) ... [2022-01-10 14:11:30,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b92995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:11:30, skipping insertion in model container [2022-01-10 14:11:30,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:11:30" (3/4) ... [2022-01-10 14:11:30,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b92995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:11:30, skipping insertion in model container [2022-01-10 14:11:30,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:11:30" (4/4) ... [2022-01-10 14:11:30,903 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.cTransformedIcfg [2022-01-10 14:11:30,907 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:11:30,907 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 14:11:30,956 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:11:30,961 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 14:11:30,962 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 14:11:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 252 states have (on average 1.5476190476190477) internal successors, (390), 255 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:31,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:31,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:31,002 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1587688960, now seen corresponding path program 1 times [2022-01-10 14:11:31,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:31,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940932632] [2022-01-10 14:11:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:31,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:31,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:31,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940932632] [2022-01-10 14:11:31,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940932632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:31,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:31,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:31,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644075194] [2022-01-10 14:11:31,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:31,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:31,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:31,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:31,392 INFO L87 Difference]: Start difference. First operand has 256 states, 252 states have (on average 1.5476190476190477) internal successors, (390), 255 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:31,535 INFO L93 Difference]: Finished difference Result 471 states and 716 transitions. [2022-01-10 14:11:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:31,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:31,555 INFO L225 Difference]: With dead ends: 471 [2022-01-10 14:11:31,555 INFO L226 Difference]: Without dead ends: 246 [2022-01-10 14:11:31,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:31,567 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 141 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:31,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 588 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-01-10 14:11:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-01-10 14:11:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 243 states have (on average 1.477366255144033) internal successors, (359), 245 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 359 transitions. [2022-01-10 14:11:31,649 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 359 transitions. Word has length 44 [2022-01-10 14:11:31,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:31,649 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 359 transitions. [2022-01-10 14:11:31,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 359 transitions. [2022-01-10 14:11:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:31,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:31,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:31,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:11:31,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1257923199, now seen corresponding path program 1 times [2022-01-10 14:11:31,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:31,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975934554] [2022-01-10 14:11:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:31,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:31,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:31,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975934554] [2022-01-10 14:11:31,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975934554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:31,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:31,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:31,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979232312] [2022-01-10 14:11:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:31,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:31,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:31,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:31,904 INFO L87 Difference]: Start difference. First operand 246 states and 359 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:32,126 INFO L93 Difference]: Finished difference Result 426 states and 618 transitions. [2022-01-10 14:11:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:32,129 INFO L225 Difference]: With dead ends: 426 [2022-01-10 14:11:32,130 INFO L226 Difference]: Without dead ends: 340 [2022-01-10 14:11:32,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,131 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 118 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 680 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.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:32,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 680 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:11:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-01-10 14:11:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2022-01-10 14:11:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 333 states have (on average 1.4414414414414414) internal successors, (480), 335 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 480 transitions. [2022-01-10 14:11:32,179 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 480 transitions. Word has length 44 [2022-01-10 14:11:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:32,180 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 480 transitions. [2022-01-10 14:11:32,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 480 transitions. [2022-01-10 14:11:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:32,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:32,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:32,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:11:32,182 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:32,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1618664449, now seen corresponding path program 1 times [2022-01-10 14:11:32,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:32,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672423873] [2022-01-10 14:11:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:32,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:32,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672423873] [2022-01-10 14:11:32,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672423873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:32,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:32,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:32,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245450306] [2022-01-10 14:11:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:32,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:32,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,302 INFO L87 Difference]: Start difference. First operand 336 states and 480 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:32,369 INFO L93 Difference]: Finished difference Result 622 states and 876 transitions. [2022-01-10 14:11:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:32,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:32,375 INFO L225 Difference]: With dead ends: 622 [2022-01-10 14:11:32,375 INFO L226 Difference]: Without dead ends: 492 [2022-01-10 14:11:32,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,386 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 309 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:32,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 473 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-10 14:11:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488. [2022-01-10 14:11:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 485 states have (on average 1.4103092783505156) internal successors, (684), 487 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 684 transitions. [2022-01-10 14:11:32,453 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 684 transitions. Word has length 44 [2022-01-10 14:11:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:32,454 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 684 transitions. [2022-01-10 14:11:32,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 684 transitions. [2022-01-10 14:11:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:32,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:32,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:32,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:11:32,457 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:32,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash -864783200, now seen corresponding path program 1 times [2022-01-10 14:11:32,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:32,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162860671] [2022-01-10 14:11:32,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:32,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:32,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:32,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162860671] [2022-01-10 14:11:32,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162860671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:32,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:32,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:32,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103672180] [2022-01-10 14:11:32,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:32,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:32,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:32,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:32,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,537 INFO L87 Difference]: Start difference. First operand 488 states and 684 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:32,582 INFO L93 Difference]: Finished difference Result 729 states and 1037 transitions. [2022-01-10 14:11:32,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:32,585 INFO L225 Difference]: With dead ends: 729 [2022-01-10 14:11:32,585 INFO L226 Difference]: Without dead ends: 589 [2022-01-10 14:11:32,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,597 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 323 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:32,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 516 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-01-10 14:11:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2022-01-10 14:11:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 584 states have (on average 1.4143835616438356) internal successors, (826), 586 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 826 transitions. [2022-01-10 14:11:32,631 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 826 transitions. Word has length 44 [2022-01-10 14:11:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:32,632 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 826 transitions. [2022-01-10 14:11:32,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 826 transitions. [2022-01-10 14:11:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:32,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:32,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:32,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:11:32,636 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:32,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash 241045184, now seen corresponding path program 1 times [2022-01-10 14:11:32,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:32,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290002315] [2022-01-10 14:11:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:32,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:32,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:32,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290002315] [2022-01-10 14:11:32,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290002315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:32,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:32,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:32,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514174823] [2022-01-10 14:11:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:32,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:32,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,716 INFO L87 Difference]: Start difference. First operand 587 states and 826 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:32,794 INFO L93 Difference]: Finished difference Result 825 states and 1173 transitions. [2022-01-10 14:11:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:32,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:32,798 INFO L225 Difference]: With dead ends: 825 [2022-01-10 14:11:32,798 INFO L226 Difference]: Without dead ends: 587 [2022-01-10 14:11:32,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,800 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 343 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:32,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 347 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-01-10 14:11:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2022-01-10 14:11:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 584 states have (on average 1.4006849315068493) internal successors, (818), 586 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 818 transitions. [2022-01-10 14:11:32,835 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 818 transitions. Word has length 44 [2022-01-10 14:11:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:32,839 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 818 transitions. [2022-01-10 14:11:32,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 818 transitions. [2022-01-10 14:11:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:32,846 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:32,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:32,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:11:32,847 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash 969453728, now seen corresponding path program 1 times [2022-01-10 14:11:32,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:32,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849887898] [2022-01-10 14:11:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:32,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:32,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:32,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849887898] [2022-01-10 14:11:32,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849887898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:32,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:32,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:32,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820185184] [2022-01-10 14:11:32,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:32,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:32,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:32,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:32,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,919 INFO L87 Difference]: Start difference. First operand 587 states and 818 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:32,980 INFO L93 Difference]: Finished difference Result 824 states and 1156 transitions. [2022-01-10 14:11:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:32,984 INFO L225 Difference]: With dead ends: 824 [2022-01-10 14:11:32,984 INFO L226 Difference]: Without dead ends: 587 [2022-01-10 14:11:32,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:32,987 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 311 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:32,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 352 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-01-10 14:11:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2022-01-10 14:11:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 584 states have (on average 1.3767123287671232) internal successors, (804), 586 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 804 transitions. [2022-01-10 14:11:33,023 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 804 transitions. Word has length 44 [2022-01-10 14:11:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:33,023 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 804 transitions. [2022-01-10 14:11:33,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 804 transitions. [2022-01-10 14:11:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:33,024 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:33,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:33,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:11:33,025 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:33,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -573279681, now seen corresponding path program 1 times [2022-01-10 14:11:33,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:33,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412908750] [2022-01-10 14:11:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:33,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:33,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:33,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412908750] [2022-01-10 14:11:33,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412908750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:33,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:33,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:33,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328757269] [2022-01-10 14:11:33,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:33,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:33,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:33,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:33,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:33,105 INFO L87 Difference]: Start difference. First operand 587 states and 804 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:33,209 INFO L93 Difference]: Finished difference Result 978 states and 1346 transitions. [2022-01-10 14:11:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:33,213 INFO L225 Difference]: With dead ends: 978 [2022-01-10 14:11:33,213 INFO L226 Difference]: Without dead ends: 749 [2022-01-10 14:11:33,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:33,215 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 493 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:33,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 1147 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-01-10 14:11:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 593. [2022-01-10 14:11:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 590 states have (on average 1.3627118644067797) internal successors, (804), 592 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 804 transitions. [2022-01-10 14:11:33,261 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 804 transitions. Word has length 44 [2022-01-10 14:11:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:33,262 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 804 transitions. [2022-01-10 14:11:33,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 804 transitions. [2022-01-10 14:11:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:33,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:33,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:33,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:11:33,264 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:33,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:33,264 INFO L85 PathProgramCache]: Analyzing trace with hash 388334336, now seen corresponding path program 1 times [2022-01-10 14:11:33,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:33,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028493349] [2022-01-10 14:11:33,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:33,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:33,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:33,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028493349] [2022-01-10 14:11:33,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028493349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:33,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:33,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:33,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362484024] [2022-01-10 14:11:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:33,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:33,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:33,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:33,318 INFO L87 Difference]: Start difference. First operand 593 states and 804 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:33,390 INFO L93 Difference]: Finished difference Result 1000 states and 1346 transitions. [2022-01-10 14:11:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:33,394 INFO L225 Difference]: With dead ends: 1000 [2022-01-10 14:11:33,394 INFO L226 Difference]: Without dead ends: 767 [2022-01-10 14:11:33,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:33,395 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 281 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:33,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 476 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-01-10 14:11:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 761. [2022-01-10 14:11:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 758 states have (on average 1.3469656992084433) internal successors, (1021), 760 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1021 transitions. [2022-01-10 14:11:33,446 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1021 transitions. Word has length 44 [2022-01-10 14:11:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:33,447 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 1021 transitions. [2022-01-10 14:11:33,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1021 transitions. [2022-01-10 14:11:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:33,448 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:33,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:33,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:11:33,448 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:33,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1822888513, now seen corresponding path program 1 times [2022-01-10 14:11:33,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:33,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638079103] [2022-01-10 14:11:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:33,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:33,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:33,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638079103] [2022-01-10 14:11:33,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638079103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:33,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:33,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:33,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842537994] [2022-01-10 14:11:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:33,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:33,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:33,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:33,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:33,484 INFO L87 Difference]: Start difference. First operand 761 states and 1021 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:33,545 INFO L93 Difference]: Finished difference Result 1171 states and 1561 transitions. [2022-01-10 14:11:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:33,549 INFO L225 Difference]: With dead ends: 1171 [2022-01-10 14:11:33,549 INFO L226 Difference]: Without dead ends: 761 [2022-01-10 14:11:33,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:33,551 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 280 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:33,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 336 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-01-10 14:11:33,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2022-01-10 14:11:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 758 states have (on average 1.3218997361477574) internal successors, (1002), 760 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1002 transitions. [2022-01-10 14:11:33,597 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1002 transitions. Word has length 44 [2022-01-10 14:11:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:33,597 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 1002 transitions. [2022-01-10 14:11:33,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1002 transitions. [2022-01-10 14:11:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 14:11:33,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:33,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:33,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 14:11:33,599 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1961544606, now seen corresponding path program 1 times [2022-01-10 14:11:33,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:33,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487095711] [2022-01-10 14:11:33,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:33,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:33,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:33,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487095711] [2022-01-10 14:11:33,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487095711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:33,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:33,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:33,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575826437] [2022-01-10 14:11:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:33,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:33,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:33,637 INFO L87 Difference]: Start difference. First operand 761 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:33,723 INFO L93 Difference]: Finished difference Result 1527 states and 1978 transitions. [2022-01-10 14:11:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 14:11:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:33,728 INFO L225 Difference]: With dead ends: 1527 [2022-01-10 14:11:33,728 INFO L226 Difference]: Without dead ends: 1119 [2022-01-10 14:11:33,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:33,730 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 268 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:33,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 459 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-01-10 14:11:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1069. [2022-01-10 14:11:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1066 states have (on average 1.298311444652908) internal successors, (1384), 1068 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1384 transitions. [2022-01-10 14:11:33,839 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1384 transitions. Word has length 44 [2022-01-10 14:11:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:33,839 INFO L470 AbstractCegarLoop]: Abstraction has 1069 states and 1384 transitions. [2022-01-10 14:11:33,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1384 transitions. [2022-01-10 14:11:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 14:11:33,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:33,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:33,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:11:33,841 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:33,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2048927453, now seen corresponding path program 1 times [2022-01-10 14:11:33,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:33,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282891182] [2022-01-10 14:11:33,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:33,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:33,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:33,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282891182] [2022-01-10 14:11:33,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282891182] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:33,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:33,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:33,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312732762] [2022-01-10 14:11:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:33,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:33,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:33,891 INFO L87 Difference]: Start difference. First operand 1069 states and 1384 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:33,997 INFO L93 Difference]: Finished difference Result 1617 states and 2140 transitions. [2022-01-10 14:11:33,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 14:11:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:34,005 INFO L225 Difference]: With dead ends: 1617 [2022-01-10 14:11:34,005 INFO L226 Difference]: Without dead ends: 1282 [2022-01-10 14:11:34,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:34,008 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 93 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:34,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 581 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2022-01-10 14:11:34,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1268. [2022-01-10 14:11:34,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1265 states have (on average 1.3059288537549407) internal successors, (1652), 1267 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1652 transitions. [2022-01-10 14:11:34,125 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1652 transitions. Word has length 45 [2022-01-10 14:11:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:34,126 INFO L470 AbstractCegarLoop]: Abstraction has 1268 states and 1652 transitions. [2022-01-10 14:11:34,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1652 transitions. [2022-01-10 14:11:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 14:11:34,127 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:34,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:34,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:11:34,127 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2019344990, now seen corresponding path program 1 times [2022-01-10 14:11:34,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:34,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330193954] [2022-01-10 14:11:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:34,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:34,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:34,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330193954] [2022-01-10 14:11:34,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330193954] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:34,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:34,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:34,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019892405] [2022-01-10 14:11:34,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:34,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:34,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:34,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:34,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:34,181 INFO L87 Difference]: Start difference. First operand 1268 states and 1652 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:34,284 INFO L93 Difference]: Finished difference Result 2156 states and 2864 transitions. [2022-01-10 14:11:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:34,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 14:11:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:34,293 INFO L225 Difference]: With dead ends: 2156 [2022-01-10 14:11:34,293 INFO L226 Difference]: Without dead ends: 1680 [2022-01-10 14:11:34,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:34,296 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 274 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:34,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 407 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-01-10 14:11:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1648. [2022-01-10 14:11:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1645 states have (on average 1.3082066869300912) internal successors, (2152), 1647 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2152 transitions. [2022-01-10 14:11:34,403 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2152 transitions. Word has length 45 [2022-01-10 14:11:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:34,403 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2152 transitions. [2022-01-10 14:11:34,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2152 transitions. [2022-01-10 14:11:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 14:11:34,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:34,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:34,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:11:34,405 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:34,406 INFO L85 PathProgramCache]: Analyzing trace with hash -755715137, now seen corresponding path program 1 times [2022-01-10 14:11:34,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:34,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975330781] [2022-01-10 14:11:34,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:34,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:34,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:34,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975330781] [2022-01-10 14:11:34,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975330781] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:34,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:34,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:34,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232904419] [2022-01-10 14:11:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:34,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:34,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:34,440 INFO L87 Difference]: Start difference. First operand 1648 states and 2152 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:34,566 INFO L93 Difference]: Finished difference Result 2851 states and 3765 transitions. [2022-01-10 14:11:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 14:11:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:34,574 INFO L225 Difference]: With dead ends: 2851 [2022-01-10 14:11:34,574 INFO L226 Difference]: Without dead ends: 1967 [2022-01-10 14:11:34,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:34,578 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 271 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:34,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 411 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2022-01-10 14:11:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1945. [2022-01-10 14:11:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1942 states have (on average 1.3063851699279094) internal successors, (2537), 1944 states have internal predecessors, (2537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2537 transitions. [2022-01-10 14:11:34,702 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2537 transitions. Word has length 51 [2022-01-10 14:11:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:34,703 INFO L470 AbstractCegarLoop]: Abstraction has 1945 states and 2537 transitions. [2022-01-10 14:11:34,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2537 transitions. [2022-01-10 14:11:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 14:11:34,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:34,704 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:34,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:11:34,705 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:34,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2133744296, now seen corresponding path program 1 times [2022-01-10 14:11:34,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:34,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183738686] [2022-01-10 14:11:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:34,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:34,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183738686] [2022-01-10 14:11:34,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183738686] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:34,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:34,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:34,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418637886] [2022-01-10 14:11:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:34,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:34,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:34,762 INFO L87 Difference]: Start difference. First operand 1945 states and 2537 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:34,987 INFO L93 Difference]: Finished difference Result 3664 states and 4866 transitions. [2022-01-10 14:11:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:34,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-10 14:11:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:34,997 INFO L225 Difference]: With dead ends: 3664 [2022-01-10 14:11:34,998 INFO L226 Difference]: Without dead ends: 2523 [2022-01-10 14:11:35,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:35,002 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 354 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:35,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 1373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2022-01-10 14:11:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 1963. [2022-01-10 14:11:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1960 states have (on average 1.2933673469387754) internal successors, (2535), 1962 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2535 transitions. [2022-01-10 14:11:35,147 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2535 transitions. Word has length 52 [2022-01-10 14:11:35,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:35,147 INFO L470 AbstractCegarLoop]: Abstraction has 1963 states and 2535 transitions. [2022-01-10 14:11:35,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2535 transitions. [2022-01-10 14:11:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 14:11:35,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:35,149 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:35,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:11:35,149 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2145060423, now seen corresponding path program 1 times [2022-01-10 14:11:35,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:35,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276608613] [2022-01-10 14:11:35,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:35,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:35,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:35,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:35,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276608613] [2022-01-10 14:11:35,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276608613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:35,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:35,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:11:35,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800748121] [2022-01-10 14:11:35,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:35,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:11:35,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:35,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:11:35,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:11:35,234 INFO L87 Difference]: Start difference. First operand 1963 states and 2535 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:35,457 INFO L93 Difference]: Finished difference Result 2189 states and 2831 transitions. [2022-01-10 14:11:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:11:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-10 14:11:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:35,466 INFO L225 Difference]: With dead ends: 2189 [2022-01-10 14:11:35,466 INFO L226 Difference]: Without dead ends: 2187 [2022-01-10 14:11:35,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:35,470 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 684 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:35,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 407 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2022-01-10 14:11:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 1961. [2022-01-10 14:11:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1959 states have (on average 1.2894333843797856) internal successors, (2526), 1960 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2526 transitions. [2022-01-10 14:11:35,693 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2526 transitions. Word has length 52 [2022-01-10 14:11:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:35,693 INFO L470 AbstractCegarLoop]: Abstraction has 1961 states and 2526 transitions. [2022-01-10 14:11:35,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2526 transitions. [2022-01-10 14:11:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 14:11:35,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:35,699 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:35,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:11:35,700 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2072363934, now seen corresponding path program 1 times [2022-01-10 14:11:35,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:35,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125462704] [2022-01-10 14:11:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:35,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:35,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125462704] [2022-01-10 14:11:35,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125462704] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:11:35,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773603632] [2022-01-10 14:11:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:35,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:11:35,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:11:35,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:11:35,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 14:11:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:36,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 14:11:36,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:11:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:36,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:11:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:36,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773603632] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:11:36,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:11:36,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 14:11:36,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139551424] [2022-01-10 14:11:36,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:11:36,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:11:36,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:11:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:11:36,718 INFO L87 Difference]: Start difference. First operand 1961 states and 2526 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:37,429 INFO L93 Difference]: Finished difference Result 4258 states and 5588 transitions. [2022-01-10 14:11:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:11:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-01-10 14:11:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:37,446 INFO L225 Difference]: With dead ends: 4258 [2022-01-10 14:11:37,446 INFO L226 Difference]: Without dead ends: 4256 [2022-01-10 14:11:37,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:11:37,449 INFO L933 BasicCegarLoop]: 472 mSDtfsCounter, 1198 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2076 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:37,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 2076 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:11:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4256 states. [2022-01-10 14:11:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4256 to 2906. [2022-01-10 14:11:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2904 states have (on average 1.3033746556473829) internal successors, (3785), 2905 states have internal predecessors, (3785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 3785 transitions. [2022-01-10 14:11:37,820 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 3785 transitions. Word has length 53 [2022-01-10 14:11:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:37,820 INFO L470 AbstractCegarLoop]: Abstraction has 2906 states and 3785 transitions. [2022-01-10 14:11:37,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3785 transitions. [2022-01-10 14:11:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:11:37,822 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:37,822 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:37,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 14:11:38,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-10 14:11:38,048 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:38,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1999013368, now seen corresponding path program 2 times [2022-01-10 14:11:38,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:38,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596268377] [2022-01-10 14:11:38,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:38,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:38,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596268377] [2022-01-10 14:11:38,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596268377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:38,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:38,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:38,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748405154] [2022-01-10 14:11:38,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:38,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:38,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:38,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:38,168 INFO L87 Difference]: Start difference. First operand 2906 states and 3785 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:38,493 INFO L93 Difference]: Finished difference Result 3970 states and 5210 transitions. [2022-01-10 14:11:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:38,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 14:11:38,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:38,502 INFO L225 Difference]: With dead ends: 3970 [2022-01-10 14:11:38,502 INFO L226 Difference]: Without dead ends: 2284 [2022-01-10 14:11:38,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:38,505 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 266 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 500 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:38,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 500 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:11:38,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2022-01-10 14:11:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2268. [2022-01-10 14:11:38,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 2266 states have (on average 1.2802294792586055) internal successors, (2901), 2267 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2901 transitions. [2022-01-10 14:11:38,760 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2901 transitions. Word has length 56 [2022-01-10 14:11:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:38,760 INFO L470 AbstractCegarLoop]: Abstraction has 2268 states and 2901 transitions. [2022-01-10 14:11:38,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2901 transitions. [2022-01-10 14:11:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 14:11:38,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:38,762 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:38,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:11:38,763 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:38,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:38,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1846776079, now seen corresponding path program 1 times [2022-01-10 14:11:38,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:38,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435265879] [2022-01-10 14:11:38,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:38,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:38,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:38,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435265879] [2022-01-10 14:11:38,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435265879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:38,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:38,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:38,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872424304] [2022-01-10 14:11:38,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:38,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:38,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:38,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:38,807 INFO L87 Difference]: Start difference. First operand 2268 states and 2901 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:39,257 INFO L93 Difference]: Finished difference Result 3523 states and 4545 transitions. [2022-01-10 14:11:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:39,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-10 14:11:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:39,267 INFO L225 Difference]: With dead ends: 3523 [2022-01-10 14:11:39,268 INFO L226 Difference]: Without dead ends: 2635 [2022-01-10 14:11:39,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:39,271 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 66 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:39,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 686 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:11:39,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2022-01-10 14:11:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2022-01-10 14:11:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2633 states have (on average 1.27155336118496) internal successors, (3348), 2634 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3348 transitions. [2022-01-10 14:11:39,587 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3348 transitions. Word has length 60 [2022-01-10 14:11:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:39,587 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 3348 transitions. [2022-01-10 14:11:39,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3348 transitions. [2022-01-10 14:11:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 14:11:39,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:39,590 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:39,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:11:39,590 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:39,591 INFO L85 PathProgramCache]: Analyzing trace with hash 568700400, now seen corresponding path program 1 times [2022-01-10 14:11:39,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:39,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333739380] [2022-01-10 14:11:39,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:39,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:39,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:39,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333739380] [2022-01-10 14:11:39,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333739380] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:39,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:39,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:39,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996106124] [2022-01-10 14:11:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:39,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:39,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:39,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:39,628 INFO L87 Difference]: Start difference. First operand 2635 states and 3348 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:39,900 INFO L93 Difference]: Finished difference Result 4450 states and 5672 transitions. [2022-01-10 14:11:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-10 14:11:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:39,924 INFO L225 Difference]: With dead ends: 4450 [2022-01-10 14:11:39,925 INFO L226 Difference]: Without dead ends: 2635 [2022-01-10 14:11:39,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:39,929 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 259 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:39,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 400 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2022-01-10 14:11:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2022-01-10 14:11:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2633 states have (on average 1.2563615647550324) internal successors, (3308), 2634 states have internal predecessors, (3308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:40,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3308 transitions. [2022-01-10 14:11:40,254 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3308 transitions. Word has length 68 [2022-01-10 14:11:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:40,255 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 3308 transitions. [2022-01-10 14:11:40,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3308 transitions. [2022-01-10 14:11:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 14:11:40,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:40,257 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:40,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 14:11:40,258 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash -474519524, now seen corresponding path program 1 times [2022-01-10 14:11:40,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:40,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444532103] [2022-01-10 14:11:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:40,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:40,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:40,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444532103] [2022-01-10 14:11:40,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444532103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:40,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:40,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:40,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869190022] [2022-01-10 14:11:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:40,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:40,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:40,298 INFO L87 Difference]: Start difference. First operand 2635 states and 3308 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:40,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:40,575 INFO L93 Difference]: Finished difference Result 4214 states and 5295 transitions. [2022-01-10 14:11:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:40,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-10 14:11:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:40,583 INFO L225 Difference]: With dead ends: 4214 [2022-01-10 14:11:40,583 INFO L226 Difference]: Without dead ends: 2637 [2022-01-10 14:11:40,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:40,587 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 99 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 698 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-10 14:11:40,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 698 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:40,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2022-01-10 14:11:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2635. [2022-01-10 14:11:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2633 states have (on average 1.2358526395746297) internal successors, (3254), 2634 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3254 transitions. [2022-01-10 14:11:40,896 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3254 transitions. Word has length 69 [2022-01-10 14:11:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:40,896 INFO L470 AbstractCegarLoop]: Abstraction has 2635 states and 3254 transitions. [2022-01-10 14:11:40,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3254 transitions. [2022-01-10 14:11:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 14:11:40,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:40,899 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] [2022-01-10 14:11:40,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 14:11:40,900 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1089977160, now seen corresponding path program 1 times [2022-01-10 14:11:40,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:40,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730463989] [2022-01-10 14:11:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:40,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:40,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730463989] [2022-01-10 14:11:40,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730463989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:40,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:40,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:40,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274945870] [2022-01-10 14:11:40,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:40,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:40,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:40,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:40,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:40,940 INFO L87 Difference]: Start difference. First operand 2635 states and 3254 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:41,305 INFO L93 Difference]: Finished difference Result 3974 states and 4934 transitions. [2022-01-10 14:11:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:41,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-01-10 14:11:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:41,312 INFO L225 Difference]: With dead ends: 3974 [2022-01-10 14:11:41,312 INFO L226 Difference]: Without dead ends: 3274 [2022-01-10 14:11:41,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:41,314 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 275 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:41,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 488 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-01-10 14:11:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3256. [2022-01-10 14:11:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3256 states, 3254 states have (on average 1.2292562999385372) internal successors, (4000), 3255 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 4000 transitions. [2022-01-10 14:11:41,659 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 4000 transitions. Word has length 70 [2022-01-10 14:11:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:41,659 INFO L470 AbstractCegarLoop]: Abstraction has 3256 states and 4000 transitions. [2022-01-10 14:11:41,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 4000 transitions. [2022-01-10 14:11:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 14:11:41,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:41,662 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] [2022-01-10 14:11:41,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 14:11:41,662 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2055421079, now seen corresponding path program 1 times [2022-01-10 14:11:41,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:41,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755992703] [2022-01-10 14:11:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:41,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:11:41,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:41,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755992703] [2022-01-10 14:11:41,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755992703] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:41,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:41,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:41,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766802361] [2022-01-10 14:11:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:41,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:41,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:41,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:41,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:41,689 INFO L87 Difference]: Start difference. First operand 3256 states and 4000 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:42,064 INFO L93 Difference]: Finished difference Result 4265 states and 5245 transitions. [2022-01-10 14:11:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:42,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 70 [2022-01-10 14:11:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:42,071 INFO L225 Difference]: With dead ends: 4265 [2022-01-10 14:11:42,071 INFO L226 Difference]: Without dead ends: 2938 [2022-01-10 14:11:42,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:42,075 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 178 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:42,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 444 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2022-01-10 14:11:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2938. [2022-01-10 14:11:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.228542234332425) internal successors, (3607), 2937 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 3607 transitions. [2022-01-10 14:11:42,558 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 3607 transitions. Word has length 70 [2022-01-10 14:11:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:42,558 INFO L470 AbstractCegarLoop]: Abstraction has 2938 states and 3607 transitions. [2022-01-10 14:11:42,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 3607 transitions. [2022-01-10 14:11:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 14:11:42,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:42,560 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] [2022-01-10 14:11:42,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 14:11:42,561 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:42,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1724016919, now seen corresponding path program 1 times [2022-01-10 14:11:42,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:42,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833856539] [2022-01-10 14:11:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:42,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:42,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:42,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833856539] [2022-01-10 14:11:42,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833856539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:42,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:42,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:42,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182839057] [2022-01-10 14:11:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:42,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:42,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:42,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:42,597 INFO L87 Difference]: Start difference. First operand 2938 states and 3607 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:42,957 INFO L93 Difference]: Finished difference Result 4663 states and 5721 transitions. [2022-01-10 14:11:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:42,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-01-10 14:11:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:42,964 INFO L225 Difference]: With dead ends: 4663 [2022-01-10 14:11:42,964 INFO L226 Difference]: Without dead ends: 3224 [2022-01-10 14:11:42,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:42,967 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 137 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:42,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 743 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2022-01-10 14:11:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 3224. [2022-01-10 14:11:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3224 states, 3222 states have (on average 1.2209807572936064) internal successors, (3934), 3223 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 3934 transitions. [2022-01-10 14:11:43,351 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 3934 transitions. Word has length 71 [2022-01-10 14:11:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:43,351 INFO L470 AbstractCegarLoop]: Abstraction has 3224 states and 3934 transitions. [2022-01-10 14:11:43,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3934 transitions. [2022-01-10 14:11:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 14:11:43,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:43,355 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:43,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 14:11:43,356 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash 963037242, now seen corresponding path program 1 times [2022-01-10 14:11:43,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711435836] [2022-01-10 14:11:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:43,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 14:11:43,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:43,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711435836] [2022-01-10 14:11:43,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711435836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:43,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:43,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:11:43,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063459018] [2022-01-10 14:11:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:43,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:43,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:43,394 INFO L87 Difference]: Start difference. First operand 3224 states and 3934 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:43,788 INFO L93 Difference]: Finished difference Result 4785 states and 5955 transitions. [2022-01-10 14:11:43,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:43,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-10 14:11:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:43,798 INFO L225 Difference]: With dead ends: 4785 [2022-01-10 14:11:43,798 INFO L226 Difference]: Without dead ends: 3571 [2022-01-10 14:11:43,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:43,815 INFO L933 BasicCegarLoop]: 311 mSDtfsCounter, 288 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:43,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 399 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2022-01-10 14:11:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3529. [2022-01-10 14:11:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3529 states, 3527 states have (on average 1.2302239863907003) internal successors, (4339), 3528 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4339 transitions. [2022-01-10 14:11:44,343 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4339 transitions. Word has length 100 [2022-01-10 14:11:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:44,343 INFO L470 AbstractCegarLoop]: Abstraction has 3529 states and 4339 transitions. [2022-01-10 14:11:44,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4339 transitions. [2022-01-10 14:11:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 14:11:44,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:44,349 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:44,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 14:11:44,349 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1505266697, now seen corresponding path program 1 times [2022-01-10 14:11:44,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:44,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953653230] [2022-01-10 14:11:44,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:44,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 14:11:44,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:44,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953653230] [2022-01-10 14:11:44,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953653230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:44,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:44,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:44,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429872406] [2022-01-10 14:11:44,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:44,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:44,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:44,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:44,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:44,388 INFO L87 Difference]: Start difference. First operand 3529 states and 4339 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:44,794 INFO L93 Difference]: Finished difference Result 4788 states and 5864 transitions. [2022-01-10 14:11:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-10 14:11:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:44,801 INFO L225 Difference]: With dead ends: 4788 [2022-01-10 14:11:44,801 INFO L226 Difference]: Without dead ends: 3499 [2022-01-10 14:11:44,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:44,805 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 229 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:44,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 448 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2022-01-10 14:11:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 3499. [2022-01-10 14:11:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3497 states have (on average 1.2173291392622247) internal successors, (4257), 3498 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4257 transitions. [2022-01-10 14:11:45,341 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4257 transitions. Word has length 103 [2022-01-10 14:11:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:45,341 INFO L470 AbstractCegarLoop]: Abstraction has 3499 states and 4257 transitions. [2022-01-10 14:11:45,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4257 transitions. [2022-01-10 14:11:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 14:11:45,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:45,347 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-10 14:11:45,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 14:11:45,347 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash -758221853, now seen corresponding path program 1 times [2022-01-10 14:11:45,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:45,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201459748] [2022-01-10 14:11:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:45,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 14:11:45,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201459748] [2022-01-10 14:11:45,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201459748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:45,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:45,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:45,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376607851] [2022-01-10 14:11:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:45,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:45,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:45,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:45,394 INFO L87 Difference]: Start difference. First operand 3499 states and 4257 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:45,702 INFO L93 Difference]: Finished difference Result 4479 states and 5427 transitions. [2022-01-10 14:11:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-01-10 14:11:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:45,710 INFO L225 Difference]: With dead ends: 4479 [2022-01-10 14:11:45,710 INFO L226 Difference]: Without dead ends: 3501 [2022-01-10 14:11:45,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:45,714 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 112 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:45,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 687 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2022-01-10 14:11:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3499. [2022-01-10 14:11:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3497 states have (on average 1.2138976265370318) internal successors, (4245), 3498 states have internal predecessors, (4245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4245 transitions. [2022-01-10 14:11:46,005 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4245 transitions. Word has length 104 [2022-01-10 14:11:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:46,005 INFO L470 AbstractCegarLoop]: Abstraction has 3499 states and 4245 transitions. [2022-01-10 14:11:46,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4245 transitions. [2022-01-10 14:11:46,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 14:11:46,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:46,009 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:46,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 14:11:46,009 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:46,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash -554345662, now seen corresponding path program 1 times [2022-01-10 14:11:46,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:46,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628255741] [2022-01-10 14:11:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:46,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:46,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:46,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628255741] [2022-01-10 14:11:46,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628255741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:46,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:46,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:46,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490229859] [2022-01-10 14:11:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:46,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:46,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:46,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:46,049 INFO L87 Difference]: Start difference. First operand 3499 states and 4245 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:46,318 INFO L93 Difference]: Finished difference Result 4485 states and 5410 transitions. [2022-01-10 14:11:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:46,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-01-10 14:11:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:46,326 INFO L225 Difference]: With dead ends: 4485 [2022-01-10 14:11:46,326 INFO L226 Difference]: Without dead ends: 3507 [2022-01-10 14:11:46,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:46,330 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 108 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:46,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 653 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2022-01-10 14:11:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 3499. [2022-01-10 14:11:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3497 states have (on average 1.2024592507863883) internal successors, (4205), 3498 states have internal predecessors, (4205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 4205 transitions. [2022-01-10 14:11:46,659 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 4205 transitions. Word has length 104 [2022-01-10 14:11:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:46,659 INFO L470 AbstractCegarLoop]: Abstraction has 3499 states and 4205 transitions. [2022-01-10 14:11:46,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 4205 transitions. [2022-01-10 14:11:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 14:11:46,663 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:46,663 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 14:11:46,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 14:11:46,664 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1315072538, now seen corresponding path program 1 times [2022-01-10 14:11:46,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:46,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918525186] [2022-01-10 14:11:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:46,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 14:11:46,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918525186] [2022-01-10 14:11:46,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918525186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:46,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:46,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:46,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979847023] [2022-01-10 14:11:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:46,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:46,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:46,721 INFO L87 Difference]: Start difference. First operand 3499 states and 4205 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:47,078 INFO L93 Difference]: Finished difference Result 4551 states and 5396 transitions. [2022-01-10 14:11:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 105 [2022-01-10 14:11:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:47,085 INFO L225 Difference]: With dead ends: 4551 [2022-01-10 14:11:47,085 INFO L226 Difference]: Without dead ends: 2891 [2022-01-10 14:11:47,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:47,089 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 376 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:47,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 928 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-01-10 14:11:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2825. [2022-01-10 14:11:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2823 states have (on average 1.2089975203684025) internal successors, (3413), 2824 states have internal predecessors, (3413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3413 transitions. [2022-01-10 14:11:47,323 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3413 transitions. Word has length 105 [2022-01-10 14:11:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:47,323 INFO L470 AbstractCegarLoop]: Abstraction has 2825 states and 3413 transitions. [2022-01-10 14:11:47,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3413 transitions. [2022-01-10 14:11:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 14:11:47,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:47,328 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 14:11:47,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 14:11:47,328 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1528765916, now seen corresponding path program 1 times [2022-01-10 14:11:47,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:47,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037019214] [2022-01-10 14:11:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:47,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:11:47,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:47,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037019214] [2022-01-10 14:11:47,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037019214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:47,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:47,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:11:47,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966172076] [2022-01-10 14:11:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:47,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:11:47,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:11:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:11:47,439 INFO L87 Difference]: Start difference. First operand 2825 states and 3413 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:47,890 INFO L93 Difference]: Finished difference Result 2829 states and 3417 transitions. [2022-01-10 14:11:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:11:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-10 14:11:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:47,895 INFO L225 Difference]: With dead ends: 2829 [2022-01-10 14:11:47,895 INFO L226 Difference]: Without dead ends: 2213 [2022-01-10 14:11:47,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:11:47,897 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 320 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:47,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 731 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states. [2022-01-10 14:11:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2213. [2022-01-10 14:11:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2212 states have (on average 1.2400542495479205) internal successors, (2743), 2212 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2743 transitions. [2022-01-10 14:11:48,239 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2743 transitions. Word has length 105 [2022-01-10 14:11:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:48,240 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 2743 transitions. [2022-01-10 14:11:48,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2743 transitions. [2022-01-10 14:11:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 14:11:48,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:48,242 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] [2022-01-10 14:11:48,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 14:11:48,242 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:48,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1800033116, now seen corresponding path program 1 times [2022-01-10 14:11:48,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:48,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170130556] [2022-01-10 14:11:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:48,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:48,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170130556] [2022-01-10 14:11:48,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170130556] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:48,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:48,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:48,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30630115] [2022-01-10 14:11:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:48,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:48,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:48,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:48,280 INFO L87 Difference]: Start difference. First operand 2213 states and 2743 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:48,470 INFO L93 Difference]: Finished difference Result 3213 states and 4001 transitions. [2022-01-10 14:11:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-10 14:11:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:48,474 INFO L225 Difference]: With dead ends: 3213 [2022-01-10 14:11:48,474 INFO L226 Difference]: Without dead ends: 1222 [2022-01-10 14:11:48,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:48,477 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 32 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:48,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 264 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-01-10 14:11:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1167. [2022-01-10 14:11:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1166 states have (on average 1.2246998284734134) internal successors, (1428), 1166 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1428 transitions. [2022-01-10 14:11:48,624 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1428 transitions. Word has length 106 [2022-01-10 14:11:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:48,624 INFO L470 AbstractCegarLoop]: Abstraction has 1167 states and 1428 transitions. [2022-01-10 14:11:48,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1428 transitions. [2022-01-10 14:11:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 14:11:48,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:48,626 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:48,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 14:11:48,627 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:48,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1614330739, now seen corresponding path program 1 times [2022-01-10 14:11:48,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:48,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222461951] [2022-01-10 14:11:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:48,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:48,666 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:11:48,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:48,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222461951] [2022-01-10 14:11:48,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222461951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:48,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:48,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:48,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579560222] [2022-01-10 14:11:48,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:48,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:48,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:48,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:48,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:48,668 INFO L87 Difference]: Start difference. First operand 1167 states and 1428 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:48,804 INFO L93 Difference]: Finished difference Result 2097 states and 2598 transitions. [2022-01-10 14:11:48,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-10 14:11:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:48,806 INFO L225 Difference]: With dead ends: 2097 [2022-01-10 14:11:48,806 INFO L226 Difference]: Without dead ends: 1171 [2022-01-10 14:11:48,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:48,808 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:48,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 120 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-01-10 14:11:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2022-01-10 14:11:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1170 states have (on average 1.2119658119658119) internal successors, (1418), 1170 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1418 transitions. [2022-01-10 14:11:48,933 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1418 transitions. Word has length 110 [2022-01-10 14:11:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:48,933 INFO L470 AbstractCegarLoop]: Abstraction has 1171 states and 1418 transitions. [2022-01-10 14:11:48,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1418 transitions. [2022-01-10 14:11:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 14:11:48,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:48,935 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:48,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 14:11:48,936 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1373790610, now seen corresponding path program 1 times [2022-01-10 14:11:48,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:48,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055447771] [2022-01-10 14:11:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:48,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:11:48,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:48,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055447771] [2022-01-10 14:11:48,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055447771] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:48,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:48,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:48,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019703143] [2022-01-10 14:11:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:48,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:48,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:48,987 INFO L87 Difference]: Start difference. First operand 1171 states and 1418 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:49,121 INFO L93 Difference]: Finished difference Result 2145 states and 2634 transitions. [2022-01-10 14:11:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:49,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-10 14:11:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:49,124 INFO L225 Difference]: With dead ends: 2145 [2022-01-10 14:11:49,124 INFO L226 Difference]: Without dead ends: 1215 [2022-01-10 14:11:49,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:49,126 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 82 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:49,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 140 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2022-01-10 14:11:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2022-01-10 14:11:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 1.1927512355848435) internal successors, (1448), 1214 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1448 transitions. [2022-01-10 14:11:49,255 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1448 transitions. Word has length 110 [2022-01-10 14:11:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:49,255 INFO L470 AbstractCegarLoop]: Abstraction has 1215 states and 1448 transitions. [2022-01-10 14:11:49,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1448 transitions. [2022-01-10 14:11:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 14:11:49,258 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:49,259 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:49,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 14:11:49,259 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1591450926, now seen corresponding path program 1 times [2022-01-10 14:11:49,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:49,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606270867] [2022-01-10 14:11:49,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:49,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:11:49,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:49,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606270867] [2022-01-10 14:11:49,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606270867] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:49,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:49,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:49,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677046947] [2022-01-10 14:11:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:49,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:49,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:49,306 INFO L87 Difference]: Start difference. First operand 1215 states and 1448 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:49,448 INFO L93 Difference]: Finished difference Result 2170 states and 2613 transitions. [2022-01-10 14:11:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:49,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-10 14:11:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:49,451 INFO L225 Difference]: With dead ends: 2170 [2022-01-10 14:11:49,451 INFO L226 Difference]: Without dead ends: 1196 [2022-01-10 14:11:49,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:49,453 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 69 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:49,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 267 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-01-10 14:11:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1187. [2022-01-10 14:11:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1186 states have (on average 1.1686340640809443) internal successors, (1386), 1186 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1386 transitions. [2022-01-10 14:11:49,595 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1386 transitions. Word has length 110 [2022-01-10 14:11:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:49,596 INFO L470 AbstractCegarLoop]: Abstraction has 1187 states and 1386 transitions. [2022-01-10 14:11:49,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1386 transitions. [2022-01-10 14:11:49,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 14:11:49,597 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:49,598 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, 1] [2022-01-10 14:11:49,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 14:11:49,598 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:49,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash 304765705, now seen corresponding path program 1 times [2022-01-10 14:11:49,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:49,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073624627] [2022-01-10 14:11:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:49,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 14:11:49,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:49,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073624627] [2022-01-10 14:11:49,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073624627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:49,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:49,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:49,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625324028] [2022-01-10 14:11:49,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:49,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:49,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:49,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:49,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:49,646 INFO L87 Difference]: Start difference. First operand 1187 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:49,792 INFO L93 Difference]: Finished difference Result 1967 states and 2289 transitions. [2022-01-10 14:11:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:11:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-01-10 14:11:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:49,795 INFO L225 Difference]: With dead ends: 1967 [2022-01-10 14:11:49,795 INFO L226 Difference]: Without dead ends: 827 [2022-01-10 14:11:49,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 14:11:49,797 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 129 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:49,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 390 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2022-01-10 14:11:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 669. [2022-01-10 14:11:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.157185628742515) internal successors, (773), 668 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 773 transitions. [2022-01-10 14:11:49,882 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 773 transitions. Word has length 111 [2022-01-10 14:11:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:49,882 INFO L470 AbstractCegarLoop]: Abstraction has 669 states and 773 transitions. [2022-01-10 14:11:49,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 773 transitions. [2022-01-10 14:11:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 14:11:49,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:49,883 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:49,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 14:11:49,884 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:49,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:49,884 INFO L85 PathProgramCache]: Analyzing trace with hash 994639825, now seen corresponding path program 1 times [2022-01-10 14:11:49,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:49,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401490118] [2022-01-10 14:11:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:49,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 14:11:49,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:49,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401490118] [2022-01-10 14:11:49,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401490118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:49,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:49,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:49,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906825215] [2022-01-10 14:11:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:49,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:49,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:49,925 INFO L87 Difference]: Start difference. First operand 669 states and 773 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:50,023 INFO L93 Difference]: Finished difference Result 1174 states and 1370 transitions. [2022-01-10 14:11:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-10 14:11:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:50,024 INFO L225 Difference]: With dead ends: 1174 [2022-01-10 14:11:50,025 INFO L226 Difference]: Without dead ends: 675 [2022-01-10 14:11:50,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:50,027 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:50,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 121 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-10 14:11:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2022-01-10 14:11:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.1528189910979227) internal successors, (777), 674 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 777 transitions. [2022-01-10 14:11:50,111 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 777 transitions. Word has length 113 [2022-01-10 14:11:50,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:50,111 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 777 transitions. [2022-01-10 14:11:50,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,111 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 777 transitions. [2022-01-10 14:11:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 14:11:50,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:50,112 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:50,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 14:11:50,113 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash 545943186, now seen corresponding path program 1 times [2022-01-10 14:11:50,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:50,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949319637] [2022-01-10 14:11:50,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:50,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 14:11:50,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:50,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949319637] [2022-01-10 14:11:50,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949319637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:50,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:50,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:50,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894155753] [2022-01-10 14:11:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:50,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:50,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:50,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:50,161 INFO L87 Difference]: Start difference. First operand 675 states and 777 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:50,257 INFO L93 Difference]: Finished difference Result 1151 states and 1337 transitions. [2022-01-10 14:11:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-10 14:11:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:50,259 INFO L225 Difference]: With dead ends: 1151 [2022-01-10 14:11:50,259 INFO L226 Difference]: Without dead ends: 646 [2022-01-10 14:11:50,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:50,260 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:50,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 134 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-01-10 14:11:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 594. [2022-01-10 14:11:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.1349072512647556) internal successors, (673), 593 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 673 transitions. [2022-01-10 14:11:50,339 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 673 transitions. Word has length 113 [2022-01-10 14:11:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:50,340 INFO L470 AbstractCegarLoop]: Abstraction has 594 states and 673 transitions. [2022-01-10 14:11:50,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 673 transitions. [2022-01-10 14:11:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-10 14:11:50,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:50,341 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1] [2022-01-10 14:11:50,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 14:11:50,341 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash -242739285, now seen corresponding path program 1 times [2022-01-10 14:11:50,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:50,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478803521] [2022-01-10 14:11:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:50,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 14:11:50,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:50,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478803521] [2022-01-10 14:11:50,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478803521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:50,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:50,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:50,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023223339] [2022-01-10 14:11:50,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:50,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:50,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:50,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:50,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:50,403 INFO L87 Difference]: Start difference. First operand 594 states and 673 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:50,487 INFO L93 Difference]: Finished difference Result 1082 states and 1233 transitions. [2022-01-10 14:11:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:50,488 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 124 [2022-01-10 14:11:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:50,489 INFO L225 Difference]: With dead ends: 1082 [2022-01-10 14:11:50,489 INFO L226 Difference]: Without dead ends: 585 [2022-01-10 14:11:50,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:50,492 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 30 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:50,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 199 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-01-10 14:11:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 580. [2022-01-10 14:11:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.1036269430051813) internal successors, (639), 579 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 639 transitions. [2022-01-10 14:11:50,570 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 639 transitions. Word has length 124 [2022-01-10 14:11:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:50,570 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 639 transitions. [2022-01-10 14:11:50,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 639 transitions. [2022-01-10 14:11:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-01-10 14:11:50,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:50,572 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-01-10 14:11:50,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 14:11:50,572 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:50,573 INFO L85 PathProgramCache]: Analyzing trace with hash 674317068, now seen corresponding path program 1 times [2022-01-10 14:11:50,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:50,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747938721] [2022-01-10 14:11:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:50,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 14:11:50,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:50,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747938721] [2022-01-10 14:11:50,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747938721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:50,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:50,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:11:50,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547813166] [2022-01-10 14:11:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:50,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:11:50,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:50,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:11:50,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:11:50,638 INFO L87 Difference]: Start difference. First operand 580 states and 639 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:50,730 INFO L93 Difference]: Finished difference Result 908 states and 998 transitions. [2022-01-10 14:11:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:11:50,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 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 124 [2022-01-10 14:11:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:50,731 INFO L225 Difference]: With dead ends: 908 [2022-01-10 14:11:50,731 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 14:11:50,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:11:50,733 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 305 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:50,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 362 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 14:11:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 14:11:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 14:11:50,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2022-01-10 14:11:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:50,734 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 14:11:50,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 14:11:50,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 14:11:50,736 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-10 14:11:50,737 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-10 14:11:50,737 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-10 14:11:50,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 14:11:50,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.