/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:48:17,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:48:17,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:48:17,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:48:17,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:48:17,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:48:17,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:48:17,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:48:17,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:48:17,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:48:17,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:48:17,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:48:17,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:48:17,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:48:17,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:48:17,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:48:17,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:48:17,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:48:17,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:48:17,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:48:17,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:48:17,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:48:17,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:48:17,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:48:17,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:48:17,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:48:17,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:48:17,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:48:17,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:48:17,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:48:17,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:48:17,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:48:17,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:48:17,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:48:17,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:48:17,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:48:17,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:48:17,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:48:17,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:48:17,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:48:17,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:48:17,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:48:17,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:48:17,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:48:17,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:48:17,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:48:17,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:48:17,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:48:17,848 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:48:17,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:48:17,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:48:17,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:48:17,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:48:17,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:48:17,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:48:17,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:48:17,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:48:17,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:48:17,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:48:17,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:48:17,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:48:17,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:48:17,855 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:48:17,856 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:48:17,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:48:17,856 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:48:17,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:48:17,857 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:48:17,857 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:48:18,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:48:18,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:48:18,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:48:18,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:48:18,043 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:48:18,044 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-2.c [2022-01-11 01:48:18,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b58c1bf5/7b4f447d9fb94f3abffa5e488e797f46/FLAG05b18c484 [2022-01-11 01:48:18,504 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:48:18,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-01-11 01:48:18,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b58c1bf5/7b4f447d9fb94f3abffa5e488e797f46/FLAG05b18c484 [2022-01-11 01:48:18,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b58c1bf5/7b4f447d9fb94f3abffa5e488e797f46 [2022-01-11 01:48:18,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:48:18,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:48:18,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:48:18,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:48:18,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:48:18,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9080b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18, skipping insertion in model container [2022-01-11 01:48:18,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:48:18,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:48:18,665 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-2.c[914,927] [2022-01-11 01:48:18,704 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-2.c[7115,7128] [2022-01-11 01:48:18,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:48:18,766 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:48:18,784 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-2.c[914,927] [2022-01-11 01:48:18,806 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-2.c[7115,7128] [2022-01-11 01:48:18,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:48:18,842 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:48:18,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18 WrapperNode [2022-01-11 01:48:18,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:48:18,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:48:18,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:48:18,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:48:18,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,903 INFO L137 Inliner]: procedures = 56, calls = 61, calls flagged for inlining = 56, calls inlined = 66, statements flattened = 718 [2022-01-11 01:48:18,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:48:18,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:48:18,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:48:18,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:48:18,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:48:18,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:48:18,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:48:18,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:48:18,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (1/1) ... [2022-01-11 01:48:18,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:48:18,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:48:18,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:48:18,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:48:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:48:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:48:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:48:19,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:48:19,089 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:48:19,090 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:48:19,562 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:48:19,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:48:19,576 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-11 01:48:19,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:19 BoogieIcfgContainer [2022-01-11 01:48:19,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:48:19,579 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:48:19,579 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:48:19,580 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:48:19,582 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:19" (1/1) ... [2022-01-11 01:48:19,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:48:19 BasicIcfg [2022-01-11 01:48:19,727 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:48:19,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:48:19,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:48:19,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:48:19,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:48:18" (1/4) ... [2022-01-11 01:48:19,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2fd5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:48:19, skipping insertion in model container [2022-01-11 01:48:19,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:48:18" (2/4) ... [2022-01-11 01:48:19,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2fd5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:48:19, skipping insertion in model container [2022-01-11 01:48:19,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:48:19" (3/4) ... [2022-01-11 01:48:19,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2fd5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:48:19, skipping insertion in model container [2022-01-11 01:48:19,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:48:19" (4/4) ... [2022-01-11 01:48:19,741 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.cTransformedIcfg [2022-01-11 01:48:19,745 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:48:19,745 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:48:19,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:48:19,797 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:48:19,797 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:48:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 259 states have (on average 1.555984555984556) internal successors, (403), 263 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:19,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:19,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:19,827 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1016809632, now seen corresponding path program 1 times [2022-01-11 01:48:19,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:19,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593606971] [2022-01-11 01:48:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:19,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:20,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:20,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593606971] [2022-01-11 01:48:20,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593606971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:20,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:20,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:20,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432890940] [2022-01-11 01:48:20,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:20,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:20,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:20,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:20,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,121 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.555984555984556) internal successors, (403), 263 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:20,254 INFO L93 Difference]: Finished difference Result 580 states and 887 transitions. [2022-01-11 01:48:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:20,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:48:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:20,264 INFO L225 Difference]: With dead ends: 580 [2022-01-11 01:48:20,264 INFO L226 Difference]: Without dead ends: 347 [2022-01-11 01:48:20,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,269 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 124 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:20,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 720 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:48:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-01-11 01:48:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2022-01-11 01:48:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 339 states have (on average 1.4542772861356932) internal successors, (493), 342 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 493 transitions. [2022-01-11 01:48:20,316 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 493 transitions. Word has length 44 [2022-01-11 01:48:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:20,317 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 493 transitions. [2022-01-11 01:48:20,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 493 transitions. [2022-01-11 01:48:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:20,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:20,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:20,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:48:20,319 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:20,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1377550882, now seen corresponding path program 1 times [2022-01-11 01:48:20,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:20,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867209192] [2022-01-11 01:48:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:20,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:20,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:20,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867209192] [2022-01-11 01:48:20,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867209192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:20,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:20,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:20,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670925359] [2022-01-11 01:48:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:20,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:20,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:20,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:20,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,369 INFO L87 Difference]: Start difference. First operand 343 states and 493 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:20,398 INFO L93 Difference]: Finished difference Result 629 states and 891 transitions. [2022-01-11 01:48:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:20,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:48:20,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:20,401 INFO L225 Difference]: With dead ends: 629 [2022-01-11 01:48:20,401 INFO L226 Difference]: Without dead ends: 499 [2022-01-11 01:48:20,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,403 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 331 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:20,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 486 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-01-11 01:48:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 495. [2022-01-11 01:48:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 491 states have (on average 1.4236252545824848) internal successors, (699), 494 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 699 transitions. [2022-01-11 01:48:20,436 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 699 transitions. Word has length 44 [2022-01-11 01:48:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:20,437 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 699 transitions. [2022-01-11 01:48:20,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 699 transitions. [2022-01-11 01:48:20,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:20,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:20,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:20,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:48:20,439 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 823043615, now seen corresponding path program 1 times [2022-01-11 01:48:20,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:20,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340129641] [2022-01-11 01:48:20,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:20,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:20,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:20,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340129641] [2022-01-11 01:48:20,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340129641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:20,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:20,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:20,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593476316] [2022-01-11 01:48:20,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:20,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:20,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:20,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:20,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,505 INFO L87 Difference]: Start difference. First operand 495 states and 699 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-11 01:48:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:20,569 INFO L93 Difference]: Finished difference Result 750 states and 1074 transitions. [2022-01-11 01:48:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:20,569 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-11 01:48:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:20,571 INFO L225 Difference]: With dead ends: 750 [2022-01-11 01:48:20,571 INFO L226 Difference]: Without dead ends: 603 [2022-01-11 01:48:20,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,573 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 335 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:20,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 539 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-01-11 01:48:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2022-01-11 01:48:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 595 states have (on average 1.4302521008403362) internal successors, (851), 598 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 851 transitions. [2022-01-11 01:48:20,601 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 851 transitions. Word has length 44 [2022-01-11 01:48:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:20,601 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 851 transitions. [2022-01-11 01:48:20,601 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-11 01:48:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 851 transitions. [2022-01-11 01:48:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:20,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:20,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:20,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:48:20,608 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:20,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1928871999, now seen corresponding path program 1 times [2022-01-11 01:48:20,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:20,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387276228] [2022-01-11 01:48:20,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:20,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:20,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:20,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387276228] [2022-01-11 01:48:20,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387276228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:20,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:20,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:20,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695123902] [2022-01-11 01:48:20,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:20,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:20,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:20,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,655 INFO L87 Difference]: Start difference. First operand 599 states and 851 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-11 01:48:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:20,683 INFO L93 Difference]: Finished difference Result 849 states and 1219 transitions. [2022-01-11 01:48:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:20,684 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-11 01:48:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:20,685 INFO L225 Difference]: With dead ends: 849 [2022-01-11 01:48:20,686 INFO L226 Difference]: Without dead ends: 599 [2022-01-11 01:48:20,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,695 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 355 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:20,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 359 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:20,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-11 01:48:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-01-11 01:48:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 595 states have (on average 1.4168067226890757) internal successors, (843), 598 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 843 transitions. [2022-01-11 01:48:20,720 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 843 transitions. Word has length 44 [2022-01-11 01:48:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:20,721 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 843 transitions. [2022-01-11 01:48:20,721 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-11 01:48:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 843 transitions. [2022-01-11 01:48:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:20,724 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:20,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:20,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:48:20,724 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1637686753, now seen corresponding path program 1 times [2022-01-11 01:48:20,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:20,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256063588] [2022-01-11 01:48:20,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:20,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:20,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:20,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256063588] [2022-01-11 01:48:20,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256063588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:20,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:20,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:20,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926676796] [2022-01-11 01:48:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:20,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:20,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,775 INFO L87 Difference]: Start difference. First operand 599 states and 843 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-11 01:48:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:20,817 INFO L93 Difference]: Finished difference Result 848 states and 1202 transitions. [2022-01-11 01:48:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:20,817 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-11 01:48:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:20,819 INFO L225 Difference]: With dead ends: 848 [2022-01-11 01:48:20,820 INFO L226 Difference]: Without dead ends: 599 [2022-01-11 01:48:20,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,824 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 323 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 364 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-11 01:48:20,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 364 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-11 01:48:20,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-01-11 01:48:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 595 states have (on average 1.3932773109243697) internal successors, (829), 598 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 829 transitions. [2022-01-11 01:48:20,849 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 829 transitions. Word has length 44 [2022-01-11 01:48:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:20,852 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 829 transitions. [2022-01-11 01:48:20,852 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-11 01:48:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 829 transitions. [2022-01-11 01:48:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:20,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:20,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:20,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:48:20,857 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:20,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1114547134, now seen corresponding path program 1 times [2022-01-11 01:48:20,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:20,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142051187] [2022-01-11 01:48:20,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:20,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:20,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:20,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142051187] [2022-01-11 01:48:20,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142051187] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:20,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:20,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:20,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708009934] [2022-01-11 01:48:20,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:20,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:20,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:20,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:20,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:20,968 INFO L87 Difference]: Start difference. First operand 599 states and 829 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-11 01:48:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:21,008 INFO L93 Difference]: Finished difference Result 847 states and 1173 transitions. [2022-01-11 01:48:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:21,008 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-11 01:48:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:21,010 INFO L225 Difference]: With dead ends: 847 [2022-01-11 01:48:21,010 INFO L226 Difference]: Without dead ends: 599 [2022-01-11 01:48:21,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,011 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 314 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 354 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-11 01:48:21,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 354 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-11 01:48:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-01-11 01:48:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 595 states have (on average 1.3697478991596639) internal successors, (815), 598 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 815 transitions. [2022-01-11 01:48:21,033 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 815 transitions. Word has length 44 [2022-01-11 01:48:21,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:21,034 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 815 transitions. [2022-01-11 01:48:21,034 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-11 01:48:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 815 transitions. [2022-01-11 01:48:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:21,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:21,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:21,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:48:21,035 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 504080477, now seen corresponding path program 1 times [2022-01-11 01:48:21,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:21,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342904631] [2022-01-11 01:48:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:21,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:21,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:21,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342904631] [2022-01-11 01:48:21,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342904631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:21,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:21,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:21,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387628723] [2022-01-11 01:48:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:21,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:21,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:21,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:21,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:21,084 INFO L87 Difference]: Start difference. First operand 599 states and 815 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-11 01:48:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:21,158 INFO L93 Difference]: Finished difference Result 1026 states and 1399 transitions. [2022-01-11 01:48:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:21,158 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-11 01:48:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:21,161 INFO L225 Difference]: With dead ends: 1026 [2022-01-11 01:48:21,161 INFO L226 Difference]: Without dead ends: 785 [2022-01-11 01:48:21,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:21,163 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 512 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1193 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-11 01:48:21,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 1193 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-01-11 01:48:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 605. [2022-01-11 01:48:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 601 states have (on average 1.3560732113144758) internal successors, (815), 604 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 815 transitions. [2022-01-11 01:48:21,199 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 815 transitions. Word has length 44 [2022-01-11 01:48:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:21,199 INFO L470 AbstractCegarLoop]: Abstraction has 605 states and 815 transitions. [2022-01-11 01:48:21,199 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-11 01:48:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 815 transitions. [2022-01-11 01:48:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:48:21,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:21,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:21,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:48:21,201 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1465694494, now seen corresponding path program 1 times [2022-01-11 01:48:21,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:21,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530070994] [2022-01-11 01:48:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:21,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:21,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:21,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530070994] [2022-01-11 01:48:21,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530070994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:21,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:21,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:21,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297592087] [2022-01-11 01:48:21,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:21,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:21,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:21,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:21,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,252 INFO L87 Difference]: Start difference. First operand 605 states and 815 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-11 01:48:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:21,309 INFO L93 Difference]: Finished difference Result 1057 states and 1401 transitions. [2022-01-11 01:48:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:21,309 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-11 01:48:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:21,312 INFO L225 Difference]: With dead ends: 1057 [2022-01-11 01:48:21,312 INFO L226 Difference]: Without dead ends: 805 [2022-01-11 01:48:21,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,313 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 271 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 484 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-11 01:48:21,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 484 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-01-11 01:48:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 779. [2022-01-11 01:48:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 775 states have (on average 1.3303225806451613) internal successors, (1031), 778 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1031 transitions. [2022-01-11 01:48:21,354 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1031 transitions. Word has length 44 [2022-01-11 01:48:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:21,355 INFO L470 AbstractCegarLoop]: Abstraction has 779 states and 1031 transitions. [2022-01-11 01:48:21,355 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-11 01:48:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1031 transitions. [2022-01-11 01:48:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:48:21,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:21,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:21,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:48:21,356 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -933513404, now seen corresponding path program 1 times [2022-01-11 01:48:21,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:21,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218573292] [2022-01-11 01:48:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:21,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:21,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:21,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218573292] [2022-01-11 01:48:21,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218573292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:21,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:21,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:21,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361672426] [2022-01-11 01:48:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:21,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:21,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:21,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:21,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,396 INFO L87 Difference]: Start difference. First operand 779 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:21,461 INFO L93 Difference]: Finished difference Result 1327 states and 1791 transitions. [2022-01-11 01:48:21,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:21,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 01:48:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:21,464 INFO L225 Difference]: With dead ends: 1327 [2022-01-11 01:48:21,464 INFO L226 Difference]: Without dead ends: 992 [2022-01-11 01:48:21,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,465 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 94 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:21,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 608 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-01-11 01:48:21,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 978. [2022-01-11 01:48:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 974 states have (on average 1.3336755646817249) internal successors, (1299), 977 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1299 transitions. [2022-01-11 01:48:21,508 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1299 transitions. Word has length 45 [2022-01-11 01:48:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:21,508 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 1299 transitions. [2022-01-11 01:48:21,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1299 transitions. [2022-01-11 01:48:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:48:21,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:21,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:21,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 01:48:21,509 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash -903930941, now seen corresponding path program 1 times [2022-01-11 01:48:21,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:21,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199647594] [2022-01-11 01:48:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:21,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:21,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:21,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199647594] [2022-01-11 01:48:21,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199647594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:21,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:21,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:21,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882374826] [2022-01-11 01:48:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:21,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:21,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:21,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:21,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,547 INFO L87 Difference]: Start difference. First operand 978 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:21,611 INFO L93 Difference]: Finished difference Result 1866 states and 2511 transitions. [2022-01-11 01:48:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 01:48:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:21,614 INFO L225 Difference]: With dead ends: 1866 [2022-01-11 01:48:21,614 INFO L226 Difference]: Without dead ends: 1390 [2022-01-11 01:48:21,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,616 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 288 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:21,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 421 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2022-01-11 01:48:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1358. [2022-01-11 01:48:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1354 states have (on average 1.328655834564254) internal successors, (1799), 1357 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1799 transitions. [2022-01-11 01:48:21,676 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1799 transitions. Word has length 45 [2022-01-11 01:48:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:21,676 INFO L470 AbstractCegarLoop]: Abstraction has 1358 states and 1799 transitions. [2022-01-11 01:48:21,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1799 transitions. [2022-01-11 01:48:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:48:21,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:21,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:21,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:48:21,677 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1036807712, now seen corresponding path program 1 times [2022-01-11 01:48:21,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:21,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480552945] [2022-01-11 01:48:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:21,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:21,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:21,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480552945] [2022-01-11 01:48:21,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480552945] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:21,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:21,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:21,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81008780] [2022-01-11 01:48:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:21,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:21,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,714 INFO L87 Difference]: Start difference. First operand 1358 states and 1799 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:21,786 INFO L93 Difference]: Finished difference Result 2561 states and 3412 transitions. [2022-01-11 01:48:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:21,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 01:48:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:21,791 INFO L225 Difference]: With dead ends: 2561 [2022-01-11 01:48:21,791 INFO L226 Difference]: Without dead ends: 1677 [2022-01-11 01:48:21,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:21,793 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 285 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:21,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 425 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-01-11 01:48:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1655. [2022-01-11 01:48:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1651 states have (on average 1.3228346456692914) internal successors, (2184), 1654 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2184 transitions. [2022-01-11 01:48:21,859 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2184 transitions. Word has length 51 [2022-01-11 01:48:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:21,860 INFO L470 AbstractCegarLoop]: Abstraction has 1655 states and 2184 transitions. [2022-01-11 01:48:21,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2184 transitions. [2022-01-11 01:48:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:21,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:21,861 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:21,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:48:21,861 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:21,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:21,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2009809097, now seen corresponding path program 1 times [2022-01-11 01:48:21,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:21,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775392404] [2022-01-11 01:48:21,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:21,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:21,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:21,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775392404] [2022-01-11 01:48:21,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775392404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:21,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:21,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:21,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922561742] [2022-01-11 01:48:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:21,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:21,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:21,908 INFO L87 Difference]: Start difference. First operand 1655 states and 2184 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:22,064 INFO L93 Difference]: Finished difference Result 3281 states and 4388 transitions. [2022-01-11 01:48:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 01:48:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:22,071 INFO L225 Difference]: With dead ends: 3281 [2022-01-11 01:48:22,071 INFO L226 Difference]: Without dead ends: 2330 [2022-01-11 01:48:22,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:22,073 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 395 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:22,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 1409 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2022-01-11 01:48:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 1679. [2022-01-11 01:48:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1675 states have (on average 1.3074626865671641) internal successors, (2190), 1678 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2190 transitions. [2022-01-11 01:48:22,166 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2190 transitions. Word has length 52 [2022-01-11 01:48:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:22,166 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 2190 transitions. [2022-01-11 01:48:22,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2190 transitions. [2022-01-11 01:48:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:22,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:22,167 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:22,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:48:22,167 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -334857944, now seen corresponding path program 1 times [2022-01-11 01:48:22,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:22,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455166066] [2022-01-11 01:48:22,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:22,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:22,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:22,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455166066] [2022-01-11 01:48:22,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455166066] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:22,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:22,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:22,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402151659] [2022-01-11 01:48:22,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:22,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:22,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:22,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:22,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:22,206 INFO L87 Difference]: Start difference. First operand 1679 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:22,406 INFO L93 Difference]: Finished difference Result 3434 states and 4539 transitions. [2022-01-11 01:48:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:22,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 01:48:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:22,412 INFO L225 Difference]: With dead ends: 3434 [2022-01-11 01:48:22,413 INFO L226 Difference]: Without dead ends: 2269 [2022-01-11 01:48:22,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:22,415 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 354 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:22,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 1425 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:22,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2022-01-11 01:48:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 1697. [2022-01-11 01:48:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1693 states have (on average 1.2923803898405197) internal successors, (2188), 1696 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2188 transitions. [2022-01-11 01:48:22,529 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2188 transitions. Word has length 52 [2022-01-11 01:48:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:22,530 INFO L470 AbstractCegarLoop]: Abstraction has 1697 states and 2188 transitions. [2022-01-11 01:48:22,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2188 transitions. [2022-01-11 01:48:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:48:22,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:22,531 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:22,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:48:22,531 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -323541817, now seen corresponding path program 1 times [2022-01-11 01:48:22,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:22,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501876049] [2022-01-11 01:48:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:22,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:22,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:22,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501876049] [2022-01-11 01:48:22,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501876049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:22,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:22,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:48:22,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530918683] [2022-01-11 01:48:22,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:22,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:48:22,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:22,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:48:22,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:48:22,576 INFO L87 Difference]: Start difference. First operand 1697 states and 2188 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:22,695 INFO L93 Difference]: Finished difference Result 1929 states and 2488 transitions. [2022-01-11 01:48:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:48:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 01:48:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:22,701 INFO L225 Difference]: With dead ends: 1929 [2022-01-11 01:48:22,701 INFO L226 Difference]: Without dead ends: 1927 [2022-01-11 01:48:22,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:22,702 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 709 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:22,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [709 Valid, 421 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-01-11 01:48:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1695. [2022-01-11 01:48:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1692 states have (on average 1.287825059101655) internal successors, (2179), 1694 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2179 transitions. [2022-01-11 01:48:22,816 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2179 transitions. Word has length 52 [2022-01-11 01:48:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:22,817 INFO L470 AbstractCegarLoop]: Abstraction has 1695 states and 2179 transitions. [2022-01-11 01:48:22,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2179 transitions. [2022-01-11 01:48:22,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 01:48:22,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:22,819 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:22,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:48:22,819 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1439861438, now seen corresponding path program 1 times [2022-01-11 01:48:22,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:22,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274956342] [2022-01-11 01:48:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:22,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:22,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:22,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274956342] [2022-01-11 01:48:22,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274956342] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:48:22,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180654034] [2022-01-11 01:48:22,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:22,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:48:22,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:48:22,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:48:23,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:48:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:23,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:48:23,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:48:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:23,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:48:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:23,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180654034] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:48:23,534 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:48:23,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:48:23,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830898988] [2022-01-11 01:48:23,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:48:23,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:48:23,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:23,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:48:23,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:48:23,535 INFO L87 Difference]: Start difference. First operand 1695 states and 2179 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:24,091 INFO L93 Difference]: Finished difference Result 4052 states and 5279 transitions. [2022-01-11 01:48:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:48:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-01-11 01:48:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:24,103 INFO L225 Difference]: With dead ends: 4052 [2022-01-11 01:48:24,103 INFO L226 Difference]: Without dead ends: 4050 [2022-01-11 01:48:24,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:48:24,104 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 1152 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:24,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 2134 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2022-01-11 01:48:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 2670. [2022-01-11 01:48:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2667 states have (on average 1.2973378327709035) internal successors, (3460), 2669 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 3460 transitions. [2022-01-11 01:48:24,382 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 3460 transitions. Word has length 53 [2022-01-11 01:48:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:24,382 INFO L470 AbstractCegarLoop]: Abstraction has 2670 states and 3460 transitions. [2022-01-11 01:48:24,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 3460 transitions. [2022-01-11 01:48:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:48:24,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:24,383 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:24,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 01:48:24,618 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,SelfDestructingSolverStorable14 [2022-01-11 01:48:24,619 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1008771846, now seen corresponding path program 2 times [2022-01-11 01:48:24,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:24,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806421600] [2022-01-11 01:48:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:24,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:24,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:24,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806421600] [2022-01-11 01:48:24,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806421600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:24,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:24,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:24,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017738273] [2022-01-11 01:48:24,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:24,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:24,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:24,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:24,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:24,642 INFO L87 Difference]: Start difference. First operand 2670 states and 3460 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:24,795 INFO L93 Difference]: Finished difference Result 3764 states and 4905 transitions. [2022-01-11 01:48:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 01:48:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:24,801 INFO L225 Difference]: With dead ends: 3764 [2022-01-11 01:48:24,801 INFO L226 Difference]: Without dead ends: 2024 [2022-01-11 01:48:24,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:24,804 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 279 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:24,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 512 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:24,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2022-01-11 01:48:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2008. [2022-01-11 01:48:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 2005 states have (on average 1.2748129675810473) internal successors, (2556), 2007 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2556 transitions. [2022-01-11 01:48:25,018 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2556 transitions. Word has length 56 [2022-01-11 01:48:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:25,019 INFO L470 AbstractCegarLoop]: Abstraction has 2008 states and 2556 transitions. [2022-01-11 01:48:25,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2556 transitions. [2022-01-11 01:48:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 01:48:25,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:25,020 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:25,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:48:25,020 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1737376141, now seen corresponding path program 1 times [2022-01-11 01:48:25,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:25,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631416084] [2022-01-11 01:48:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:25,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:25,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:25,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631416084] [2022-01-11 01:48:25,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631416084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:25,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:25,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:25,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874986771] [2022-01-11 01:48:25,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:25,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:25,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:25,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:25,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:25,047 INFO L87 Difference]: Start difference. First operand 2008 states and 2556 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:25,285 INFO L93 Difference]: Finished difference Result 4495 states and 5704 transitions. [2022-01-11 01:48:25,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:25,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-11 01:48:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:25,292 INFO L225 Difference]: With dead ends: 4495 [2022-01-11 01:48:25,292 INFO L226 Difference]: Without dead ends: 2393 [2022-01-11 01:48:25,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:25,295 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 89 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:25,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 734 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-01-11 01:48:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2022-01-11 01:48:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2390 states have (on average 1.2615062761506277) internal successors, (3015), 2392 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3015 transitions. [2022-01-11 01:48:25,483 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3015 transitions. Word has length 60 [2022-01-11 01:48:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:25,483 INFO L470 AbstractCegarLoop]: Abstraction has 2393 states and 3015 transitions. [2022-01-11 01:48:25,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3015 transitions. [2022-01-11 01:48:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 01:48:25,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:25,485 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:25,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:48:25,485 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 575876722, now seen corresponding path program 1 times [2022-01-11 01:48:25,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:25,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12799829] [2022-01-11 01:48:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:25,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:25,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:25,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12799829] [2022-01-11 01:48:25,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12799829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:25,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:25,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:25,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186323118] [2022-01-11 01:48:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:25,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:25,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:25,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:25,508 INFO L87 Difference]: Start difference. First operand 2393 states and 3015 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:25,673 INFO L93 Difference]: Finished difference Result 4256 states and 5367 transitions. [2022-01-11 01:48:25,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 01:48:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:25,679 INFO L225 Difference]: With dead ends: 4256 [2022-01-11 01:48:25,679 INFO L226 Difference]: Without dead ends: 2393 [2022-01-11 01:48:25,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:25,681 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 271 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:25,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 412 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-01-11 01:48:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2393. [2022-01-11 01:48:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2390 states have (on average 1.2447698744769875) internal successors, (2975), 2392 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 2975 transitions. [2022-01-11 01:48:25,862 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 2975 transitions. Word has length 68 [2022-01-11 01:48:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:25,862 INFO L470 AbstractCegarLoop]: Abstraction has 2393 states and 2975 transitions. [2022-01-11 01:48:25,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2975 transitions. [2022-01-11 01:48:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 01:48:25,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:25,864 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:25,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:48:25,864 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -252053568, now seen corresponding path program 1 times [2022-01-11 01:48:25,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:25,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198752673] [2022-01-11 01:48:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:25,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:48:25,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:25,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198752673] [2022-01-11 01:48:25,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198752673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:25,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:25,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:25,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560882405] [2022-01-11 01:48:25,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:25,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:25,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:25,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:25,886 INFO L87 Difference]: Start difference. First operand 2393 states and 2975 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:26,036 INFO L93 Difference]: Finished difference Result 3692 states and 4609 transitions. [2022-01-11 01:48:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 01:48:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:26,040 INFO L225 Difference]: With dead ends: 3692 [2022-01-11 01:48:26,040 INFO L226 Difference]: Without dead ends: 2067 [2022-01-11 01:48:26,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:26,043 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 99 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:26,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 721 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-01-11 01:48:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2065. [2022-01-11 01:48:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 2062 states have (on average 1.2322987390882638) internal successors, (2541), 2064 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2541 transitions. [2022-01-11 01:48:26,189 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2541 transitions. Word has length 69 [2022-01-11 01:48:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:26,189 INFO L470 AbstractCegarLoop]: Abstraction has 2065 states and 2541 transitions. [2022-01-11 01:48:26,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2541 transitions. [2022-01-11 01:48:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 01:48:26,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:26,191 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-11 01:48:26,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:48:26,191 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash 578347376, now seen corresponding path program 1 times [2022-01-11 01:48:26,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:26,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673859715] [2022-01-11 01:48:26,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:26,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:26,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:26,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673859715] [2022-01-11 01:48:26,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673859715] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:26,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:26,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:26,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579522722] [2022-01-11 01:48:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:26,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:26,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:26,228 INFO L87 Difference]: Start difference. First operand 2065 states and 2541 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-11 01:48:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:26,397 INFO L93 Difference]: Finished difference Result 2837 states and 3536 transitions. [2022-01-11 01:48:26,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:26,397 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-11 01:48:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:26,402 INFO L225 Difference]: With dead ends: 2837 [2022-01-11 01:48:26,402 INFO L226 Difference]: Without dead ends: 2417 [2022-01-11 01:48:26,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:26,404 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 270 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:26,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 468 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-01-11 01:48:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2381. [2022-01-11 01:48:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 2378 states have (on average 1.2392767031118588) internal successors, (2947), 2380 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 2947 transitions. [2022-01-11 01:48:26,578 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 2947 transitions. Word has length 70 [2022-01-11 01:48:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:26,579 INFO L470 AbstractCegarLoop]: Abstraction has 2381 states and 2947 transitions. [2022-01-11 01:48:26,579 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-11 01:48:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2947 transitions. [2022-01-11 01:48:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 01:48:26,580 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:26,580 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-11 01:48:26,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:48:26,581 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:26,581 INFO L85 PathProgramCache]: Analyzing trace with hash -27950161, now seen corresponding path program 1 times [2022-01-11 01:48:26,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:26,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155738897] [2022-01-11 01:48:26,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:26,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:26,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:26,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155738897] [2022-01-11 01:48:26,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155738897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:26,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:26,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:26,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861254745] [2022-01-11 01:48:26,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:26,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:26,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:26,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:26,608 INFO L87 Difference]: Start difference. First operand 2381 states and 2947 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-11 01:48:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:26,871 INFO L93 Difference]: Finished difference Result 3768 states and 4717 transitions. [2022-01-11 01:48:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:26,871 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-11 01:48:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:26,875 INFO L225 Difference]: With dead ends: 3768 [2022-01-11 01:48:26,876 INFO L226 Difference]: Without dead ends: 3042 [2022-01-11 01:48:26,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:26,877 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 285 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 520 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-11 01:48:26,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 520 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2022-01-11 01:48:27,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 3022. [2022-01-11 01:48:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 3019 states have (on average 1.236502153030805) internal successors, (3733), 3021 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 3733 transitions. [2022-01-11 01:48:27,085 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 3733 transitions. Word has length 70 [2022-01-11 01:48:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:27,085 INFO L470 AbstractCegarLoop]: Abstraction has 3022 states and 3733 transitions. [2022-01-11 01:48:27,085 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-11 01:48:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 3733 transitions. [2022-01-11 01:48:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 01:48:27,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:27,087 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-11 01:48:27,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:48:27,087 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:27,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:27,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1121618896, now seen corresponding path program 1 times [2022-01-11 01:48:27,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:27,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050168910] [2022-01-11 01:48:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:27,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:48:27,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:27,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050168910] [2022-01-11 01:48:27,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050168910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:27,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:27,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:27,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924049610] [2022-01-11 01:48:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:27,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:27,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:27,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:27,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:27,106 INFO L87 Difference]: Start difference. First operand 3022 states and 3733 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-11 01:48:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:27,293 INFO L93 Difference]: Finished difference Result 4372 states and 5435 transitions. [2022-01-11 01:48:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:27,294 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-11 01:48:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:27,297 INFO L225 Difference]: With dead ends: 4372 [2022-01-11 01:48:27,297 INFO L226 Difference]: Without dead ends: 2999 [2022-01-11 01:48:27,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:27,299 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 189 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:27,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 453 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2022-01-11 01:48:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2022-01-11 01:48:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2996 states have (on average 1.2376502002670227) internal successors, (3708), 2998 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3708 transitions. [2022-01-11 01:48:27,462 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3708 transitions. Word has length 70 [2022-01-11 01:48:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:27,462 INFO L470 AbstractCegarLoop]: Abstraction has 2999 states and 3708 transitions. [2022-01-11 01:48:27,462 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-11 01:48:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3708 transitions. [2022-01-11 01:48:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-11 01:48:27,463 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:27,463 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-11 01:48:27,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:48:27,464 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1428008370, now seen corresponding path program 1 times [2022-01-11 01:48:27,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041534596] [2022-01-11 01:48:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:27,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:27,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:27,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041534596] [2022-01-11 01:48:27,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041534596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:27,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:27,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:27,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750738737] [2022-01-11 01:48:27,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:27,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:27,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:27,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:27,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:27,486 INFO L87 Difference]: Start difference. First operand 2999 states and 3708 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-11 01:48:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:27,702 INFO L93 Difference]: Finished difference Result 5455 states and 6767 transitions. [2022-01-11 01:48:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:27,703 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-11 01:48:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:27,708 INFO L225 Difference]: With dead ends: 5455 [2022-01-11 01:48:27,708 INFO L226 Difference]: Without dead ends: 3553 [2022-01-11 01:48:27,710 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-11 01:48:27,711 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 137 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:27,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 763 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2022-01-11 01:48:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3553. [2022-01-11 01:48:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3550 states have (on average 1.2290140845070423) internal successors, (4363), 3552 states have internal predecessors, (4363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4363 transitions. [2022-01-11 01:48:27,923 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4363 transitions. Word has length 71 [2022-01-11 01:48:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:27,924 INFO L470 AbstractCegarLoop]: Abstraction has 3553 states and 4363 transitions. [2022-01-11 01:48:27,924 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-11 01:48:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4363 transitions. [2022-01-11 01:48:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 01:48:27,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:27,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:27,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:48:27,927 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1055397483, now seen corresponding path program 1 times [2022-01-11 01:48:27,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:27,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601068855] [2022-01-11 01:48:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:27,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 01:48:27,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601068855] [2022-01-11 01:48:27,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601068855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:27,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:27,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:48:27,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488120496] [2022-01-11 01:48:27,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:27,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:27,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:27,945 INFO L87 Difference]: Start difference. First operand 3553 states and 4363 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:28,183 INFO L93 Difference]: Finished difference Result 5197 states and 6467 transitions. [2022-01-11 01:48:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:28,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-11 01:48:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:28,189 INFO L225 Difference]: With dead ends: 5197 [2022-01-11 01:48:28,190 INFO L226 Difference]: Without dead ends: 3829 [2022-01-11 01:48:28,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:28,192 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 298 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:28,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 406 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2022-01-11 01:48:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3790. [2022-01-11 01:48:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3787 states have (on average 1.2413519936625297) internal successors, (4701), 3789 states have internal predecessors, (4701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 4701 transitions. [2022-01-11 01:48:28,437 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 4701 transitions. Word has length 100 [2022-01-11 01:48:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:28,437 INFO L470 AbstractCegarLoop]: Abstraction has 3790 states and 4701 transitions. [2022-01-11 01:48:28,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4701 transitions. [2022-01-11 01:48:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 01:48:28,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:28,440 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-11 01:48:28,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:48:28,440 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:28,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1520728213, now seen corresponding path program 1 times [2022-01-11 01:48:28,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:28,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792037188] [2022-01-11 01:48:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:28,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:28,462 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-11 01:48:28,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:28,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792037188] [2022-01-11 01:48:28,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792037188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:28,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:28,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:28,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76412614] [2022-01-11 01:48:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:28,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:28,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:28,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:28,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:28,464 INFO L87 Difference]: Start difference. First operand 3790 states and 4701 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-11 01:48:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:28,698 INFO L93 Difference]: Finished difference Result 5640 states and 6981 transitions. [2022-01-11 01:48:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:28,699 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-11 01:48:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:28,704 INFO L225 Difference]: With dead ends: 5640 [2022-01-11 01:48:28,704 INFO L226 Difference]: Without dead ends: 3742 [2022-01-11 01:48:28,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:28,707 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 227 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:28,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 468 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2022-01-11 01:48:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2022-01-11 01:48:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3739 states have (on average 1.2209146830703397) internal successors, (4565), 3741 states have internal predecessors, (4565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4565 transitions. [2022-01-11 01:48:29,025 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4565 transitions. Word has length 103 [2022-01-11 01:48:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:29,025 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 4565 transitions. [2022-01-11 01:48:29,025 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-11 01:48:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4565 transitions. [2022-01-11 01:48:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 01:48:29,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:29,028 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-11 01:48:29,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:48:29,028 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -195214301, now seen corresponding path program 1 times [2022-01-11 01:48:29,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:29,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763670183] [2022-01-11 01:48:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:29,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:29,059 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-11 01:48:29,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:29,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763670183] [2022-01-11 01:48:29,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763670183] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:29,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:29,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:29,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327147991] [2022-01-11 01:48:29,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:29,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:29,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:29,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:29,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:29,061 INFO L87 Difference]: Start difference. First operand 3742 states and 4565 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-11 01:48:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:29,354 INFO L93 Difference]: Finished difference Result 5596 states and 6783 transitions. [2022-01-11 01:48:29,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:29,354 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-11 01:48:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:29,361 INFO L225 Difference]: With dead ends: 5596 [2022-01-11 01:48:29,361 INFO L226 Difference]: Without dead ends: 3746 [2022-01-11 01:48:29,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:29,364 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 123 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 705 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-11 01:48:29,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 705 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2022-01-11 01:48:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3742. [2022-01-11 01:48:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3739 states have (on average 1.2144958545065525) internal successors, (4541), 3741 states have internal predecessors, (4541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4541 transitions. [2022-01-11 01:48:29,590 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4541 transitions. Word has length 104 [2022-01-11 01:48:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:29,591 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 4541 transitions. [2022-01-11 01:48:29,591 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-11 01:48:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4541 transitions. [2022-01-11 01:48:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 01:48:29,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:29,593 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-11 01:48:29,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:48:29,594 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1437178814, now seen corresponding path program 1 times [2022-01-11 01:48:29,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:29,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955319591] [2022-01-11 01:48:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:29,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:29,619 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-11 01:48:29,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:29,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955319591] [2022-01-11 01:48:29,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955319591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:29,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:29,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:29,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052895203] [2022-01-11 01:48:29,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:29,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:29,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:29,620 INFO L87 Difference]: Start difference. First operand 3742 states and 4541 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-11 01:48:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:29,852 INFO L93 Difference]: Finished difference Result 5035 states and 6071 transitions. [2022-01-11 01:48:29,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:29,853 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-11 01:48:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:29,858 INFO L225 Difference]: With dead ends: 5035 [2022-01-11 01:48:29,858 INFO L226 Difference]: Without dead ends: 3185 [2022-01-11 01:48:29,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:29,860 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 119 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:29,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 662 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2022-01-11 01:48:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3177. [2022-01-11 01:48:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 3174 states have (on average 1.2069943289224954) internal successors, (3831), 3176 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 3831 transitions. [2022-01-11 01:48:30,060 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 3831 transitions. Word has length 104 [2022-01-11 01:48:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:30,060 INFO L470 AbstractCegarLoop]: Abstraction has 3177 states and 3831 transitions. [2022-01-11 01:48:30,060 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-11 01:48:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3831 transitions. [2022-01-11 01:48:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 01:48:30,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:30,063 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-11 01:48:30,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:48:30,063 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash -267048485, now seen corresponding path program 1 times [2022-01-11 01:48:30,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:30,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273454254] [2022-01-11 01:48:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:30,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:30,110 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-11 01:48:30,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:30,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273454254] [2022-01-11 01:48:30,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273454254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:30,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:30,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:48:30,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431011577] [2022-01-11 01:48:30,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:30,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:48:30,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:30,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:48:30,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:48:30,112 INFO L87 Difference]: Start difference. First operand 3177 states and 3831 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-11 01:48:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:30,342 INFO L93 Difference]: Finished difference Result 4245 states and 5051 transitions. [2022-01-11 01:48:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:48:30,342 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-11 01:48:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:30,346 INFO L225 Difference]: With dead ends: 4245 [2022-01-11 01:48:30,346 INFO L226 Difference]: Without dead ends: 2557 [2022-01-11 01:48:30,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:48:30,348 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 412 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 931 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-11 01:48:30,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 931 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2022-01-11 01:48:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2491. [2022-01-11 01:48:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2491 states, 2488 states have (on average 1.2118167202572347) internal successors, (3015), 2490 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3015 transitions. [2022-01-11 01:48:30,547 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3015 transitions. Word has length 105 [2022-01-11 01:48:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:30,547 INFO L470 AbstractCegarLoop]: Abstraction has 2491 states and 3015 transitions. [2022-01-11 01:48:30,547 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-11 01:48:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3015 transitions. [2022-01-11 01:48:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 01:48:30,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:30,549 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-11 01:48:30,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:48:30,549 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:30,549 INFO L85 PathProgramCache]: Analyzing trace with hash -480741863, now seen corresponding path program 1 times [2022-01-11 01:48:30,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:30,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894478739] [2022-01-11 01:48:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:30,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:30,603 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-11 01:48:30,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:30,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894478739] [2022-01-11 01:48:30,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894478739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:30,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:30,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:48:30,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092722233] [2022-01-11 01:48:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:30,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:48:30,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:48:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:48:30,604 INFO L87 Difference]: Start difference. First operand 2491 states and 3015 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-11 01:48:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:31,006 INFO L93 Difference]: Finished difference Result 2495 states and 3019 transitions. [2022-01-11 01:48:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:48:31,006 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-11 01:48:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:31,009 INFO L225 Difference]: With dead ends: 2495 [2022-01-11 01:48:31,009 INFO L226 Difference]: Without dead ends: 2493 [2022-01-11 01:48:31,010 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-11 01:48:31,013 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 330 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 751 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-11 01:48:31,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 751 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-01-11 01:48:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2489. [2022-01-11 01:48:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 1.2110977080820264) internal successors, (3012), 2488 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3012 transitions. [2022-01-11 01:48:31,277 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3012 transitions. Word has length 105 [2022-01-11 01:48:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:31,279 INFO L470 AbstractCegarLoop]: Abstraction has 2489 states and 3012 transitions. [2022-01-11 01:48:31,279 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-11 01:48:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3012 transitions. [2022-01-11 01:48:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 01:48:31,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:31,281 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, 1, 1, 1, 1] [2022-01-11 01:48:31,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:48:31,281 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -70277620, now seen corresponding path program 1 times [2022-01-11 01:48:31,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:31,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933992269] [2022-01-11 01:48:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:31,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:31,328 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-11 01:48:31,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:31,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933992269] [2022-01-11 01:48:31,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933992269] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:31,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:31,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:31,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438138126] [2022-01-11 01:48:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:31,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:31,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:31,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:31,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:31,329 INFO L87 Difference]: Start difference. First operand 2489 states and 3012 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:31,581 INFO L93 Difference]: Finished difference Result 3163 states and 3761 transitions. [2022-01-11 01:48:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-01-11 01:48:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:31,584 INFO L225 Difference]: With dead ends: 3163 [2022-01-11 01:48:31,584 INFO L226 Difference]: Without dead ends: 2815 [2022-01-11 01:48:31,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:31,585 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 126 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:31,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 704 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2022-01-11 01:48:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2491. [2022-01-11 01:48:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2491 states, 2489 states have (on average 1.2109280835676979) internal successors, (3014), 2490 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3014 transitions. [2022-01-11 01:48:31,779 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3014 transitions. Word has length 109 [2022-01-11 01:48:31,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:31,779 INFO L470 AbstractCegarLoop]: Abstraction has 2491 states and 3014 transitions. [2022-01-11 01:48:31,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3014 transitions. [2022-01-11 01:48:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:48:31,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:31,781 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:31,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:48:31,781 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:31,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash 387509070, now seen corresponding path program 1 times [2022-01-11 01:48:31,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:31,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598726169] [2022-01-11 01:48:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:31,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:48:31,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:31,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598726169] [2022-01-11 01:48:31,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598726169] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:31,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:31,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:31,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693170351] [2022-01-11 01:48:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:31,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:31,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:31,806 INFO L87 Difference]: Start difference. First operand 2491 states and 3014 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:32,013 INFO L93 Difference]: Finished difference Result 4100 states and 5059 transitions. [2022-01-11 01:48:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:32,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 01:48:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:32,016 INFO L225 Difference]: With dead ends: 4100 [2022-01-11 01:48:32,016 INFO L226 Difference]: Without dead ends: 2499 [2022-01-11 01:48:32,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:32,018 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 69 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:32,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 466 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2022-01-11 01:48:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2499. [2022-01-11 01:48:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2497 states have (on average 1.199839807769323) internal successors, (2996), 2498 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 2996 transitions. [2022-01-11 01:48:32,219 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 2996 transitions. Word has length 110 [2022-01-11 01:48:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:32,220 INFO L470 AbstractCegarLoop]: Abstraction has 2499 states and 2996 transitions. [2022-01-11 01:48:32,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 2996 transitions. [2022-01-11 01:48:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:48:32,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:32,221 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:32,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:48:32,222 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 146968941, now seen corresponding path program 1 times [2022-01-11 01:48:32,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:32,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820369288] [2022-01-11 01:48:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:32,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:48:32,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:32,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820369288] [2022-01-11 01:48:32,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820369288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:32,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:32,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:32,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714486390] [2022-01-11 01:48:32,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:32,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:32,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:32,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:32,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:32,264 INFO L87 Difference]: Start difference. First operand 2499 states and 2996 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:48:32,462 INFO L93 Difference]: Finished difference Result 3262 states and 3954 transitions. [2022-01-11 01:48:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:48:32,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 01:48:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:48:32,465 INFO L225 Difference]: With dead ends: 3262 [2022-01-11 01:48:32,465 INFO L226 Difference]: Without dead ends: 1653 [2022-01-11 01:48:32,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:32,467 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 253 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:48:32,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 312 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:48:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-01-11 01:48:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2022-01-11 01:48:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1651 states have (on average 1.1586917019987886) internal successors, (1913), 1652 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 1913 transitions. [2022-01-11 01:48:32,650 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 1913 transitions. Word has length 110 [2022-01-11 01:48:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:32,651 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 1913 transitions. [2022-01-11 01:48:32,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1913 transitions. [2022-01-11 01:48:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:48:32,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:32,652 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, 1, 1, 1, 1, 1] [2022-01-11 01:48:32,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:48:32,652 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:32,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2085637993, now seen corresponding path program 1 times [2022-01-11 01:48:32,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:32,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060461594] [2022-01-11 01:48:32,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:32,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 01:48:32,668 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 01:48:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 01:48:32,707 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 01:48:32,707 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 01:48:32,708 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-11 01:48:32,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-11 01:48:32,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-11 01:48:32,709 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-11 01:48:32,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:48:32,711 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-11 01:48:32,714 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 01:48:32,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:48:32 BasicIcfg [2022-01-11 01:48:32,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 01:48:32,936 INFO L158 Benchmark]: Toolchain (without parser) took 14399.89ms. Allocated memory was 242.2MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 183.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 450.1MB. Max. memory is 8.0GB. [2022-01-11 01:48:32,936 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 242.2MB. Free memory is still 201.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 01:48:32,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.90ms. Allocated memory was 242.2MB in the beginning and 358.6MB in the end (delta: 116.4MB). Free memory was 183.7MB in the beginning and 323.1MB in the end (delta: -139.4MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-01-11 01:48:32,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.36ms. Allocated memory is still 358.6MB. Free memory was 323.1MB in the beginning and 319.6MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 01:48:32,937 INFO L158 Benchmark]: Boogie Preprocessor took 50.47ms. Allocated memory is still 358.6MB. Free memory was 319.6MB in the beginning and 316.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 01:48:32,937 INFO L158 Benchmark]: RCFGBuilder took 623.29ms. Allocated memory is still 358.6MB. Free memory was 316.9MB in the beginning and 287.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-01-11 01:48:32,937 INFO L158 Benchmark]: IcfgTransformer took 155.77ms. Allocated memory is still 358.6MB. Free memory was 287.1MB in the beginning and 272.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-11 01:48:32,937 INFO L158 Benchmark]: TraceAbstraction took 13199.98ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 272.9MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 422.9MB. Max. memory is 8.0GB. [2022-01-11 01:48:32,938 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 242.2MB. Free memory is still 201.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.90ms. Allocated memory was 242.2MB in the beginning and 358.6MB in the end (delta: 116.4MB). Free memory was 183.7MB in the beginning and 323.1MB in the end (delta: -139.4MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.36ms. Allocated memory is still 358.6MB. Free memory was 323.1MB in the beginning and 319.6MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.47ms. Allocated memory is still 358.6MB. Free memory was 319.6MB in the beginning and 316.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 623.29ms. Allocated memory is still 358.6MB. Free memory was 316.9MB in the beginning and 287.1MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * IcfgTransformer took 155.77ms. Allocated memory is still 358.6MB. Free memory was 287.1MB in the beginning and 272.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13199.98ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 272.9MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 422.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 [L909] FCALL update_channels2() [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() [L747] COND FALSE !(M_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() [L912] CALL activate_threads2() [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() [L913] CALL reset_delta_events2() [L775] COND FALSE !(M_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L701] CALL, EXPR exists_runnable_thread2() [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 [L537] CALL immediate_notify() [L829] CALL activate_threads2() [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() [L537] RET immediate_notify() [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 [L597] CALL immediate_notify() [L829] CALL activate_threads2() [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() [L597] RET immediate_notify() [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=4, tmp_ndt_2=1, token=1] [L701] CALL, EXPR exists_runnable_thread2() [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=4, tmp_ndt_2=1, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 [L559] CALL error2() [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 264 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 33, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9418 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9418 mSDsluCounter, 21330 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9893 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 490 IncrementalHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 11437 mSDtfsCounter, 490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3790occurred in iteration=24, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 3640 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2349 NumberOfCodeBlocks, 2349 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2258 ConstructedInterpolants, 0 QuantifiedInterpolants, 7033 SizeOfPredicates, 2 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 34 InterpolantComputations, 31 PerfectInterpolantSequences, 370/376 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-11 01:48:32,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...