/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_SUM.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 06:04:58,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 06:04:58,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 06:04:58,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 06:04:58,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 06:04:58,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 06:04:58,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 06:04:58,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 06:04:58,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 06:04:58,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 06:04:58,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 06:04:58,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 06:04:58,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 06:04:58,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 06:04:58,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 06:04:58,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 06:04:58,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 06:04:58,866 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 06:04:58,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 06:04:58,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 06:04:58,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 06:04:58,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 06:04:58,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 06:04:58,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 06:04:58,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 06:04:58,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 06:04:58,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 06:04:58,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 06:04:58,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 06:04:58,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 06:04:58,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 06:04:58,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 06:04:58,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 06:04:58,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 06:04:58,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 06:04:58,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 06:04:58,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 06:04:58,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 06:04:58,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 06:04:58,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 06:04:58,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 06:04:58,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 06:04:58,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 06:04:58,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 06:04:58,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 06:04:58,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 06:04:58,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 06:04:58,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 06:04:58,917 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 06:04:58,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 06:04:58,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 06:04:58,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 06:04:58,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 06:04:58,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:04:58,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 06:04:58,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 06:04:58,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 06:04:58,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 06:04:58,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 06:04:58,920 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 06:04:58,921 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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 06:04:59,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 06:04:59,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 06:04:59,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 06:04:59,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 06:04:59,171 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 06:04:59,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2022-01-11 06:04:59,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45828b966/0d438f2adc02478f90330a8776618111/FLAG4dee865dd [2022-01-11 06:04:59,605 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 06:04:59,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2022-01-11 06:04:59,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45828b966/0d438f2adc02478f90330a8776618111/FLAG4dee865dd [2022-01-11 06:05:00,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45828b966/0d438f2adc02478f90330a8776618111 [2022-01-11 06:05:00,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 06:05:00,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 06:05:00,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 06:05:00,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 06:05:00,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 06:05:00,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd22970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00, skipping insertion in model container [2022-01-11 06:05:00,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 06:05:00,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 06:05:00,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c[671,684] [2022-01-11 06:05:00,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:05:00,371 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 06:05:00,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c[671,684] [2022-01-11 06:05:00,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:05:00,428 INFO L208 MainTranslator]: Completed translation [2022-01-11 06:05:00,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00 WrapperNode [2022-01-11 06:05:00,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 06:05:00,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 06:05:00,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 06:05:00,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 06:05:00,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,488 INFO L137 Inliner]: procedures = 34, calls = 41, calls flagged for inlining = 36, calls inlined = 63, statements flattened = 825 [2022-01-11 06:05:00,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 06:05:00,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 06:05:00,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 06:05:00,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 06:05:00,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 06:05:00,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 06:05:00,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 06:05:00,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 06:05:00,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (1/1) ... [2022-01-11 06:05:00,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:05:00,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:05:00,612 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 06:05:00,633 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 06:05:00,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 06:05:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 06:05:00,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 06:05:00,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 06:05:00,766 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 06:05:00,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 06:05:01,358 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 06:05:01,375 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 06:05:01,376 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-11 06:05:01,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:05:01 BoogieIcfgContainer [2022-01-11 06:05:01,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 06:05:01,381 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 06:05:01,381 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 06:05:01,382 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 06:05:01,385 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:05:01" (1/1) ... [2022-01-11 06:05:01,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:05:01 BasicIcfg [2022-01-11 06:05:01,576 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 06:05:01,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 06:05:01,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 06:05:01,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 06:05:01,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 06:05:00" (1/4) ... [2022-01-11 06:05:01,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514164dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:05:01, skipping insertion in model container [2022-01-11 06:05:01,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:05:00" (2/4) ... [2022-01-11 06:05:01,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514164dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:05:01, skipping insertion in model container [2022-01-11 06:05:01,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:05:01" (3/4) ... [2022-01-11 06:05:01,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514164dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:05:01, skipping insertion in model container [2022-01-11 06:05:01,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:05:01" (4/4) ... [2022-01-11 06:05:01,583 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.cTransformedIcfg [2022-01-11 06:05:01,588 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 06:05:01,588 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-11 06:05:01,642 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 06:05:01,648 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 06:05:01,648 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-11 06:05:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 330 states have (on average 1.5454545454545454) internal successors, (510), 332 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:01,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:01,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:01,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash 282765497, now seen corresponding path program 1 times [2022-01-11 06:05:01,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:01,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937736267] [2022-01-11 06:05:01,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:01,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:01,948 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 06:05:01,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:01,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937736267] [2022-01-11 06:05:01,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937736267] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:01,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:01,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:01,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571030125] [2022-01-11 06:05:01,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:01,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:01,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:01,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:01,992 INFO L87 Difference]: Start difference. First operand has 333 states, 330 states have (on average 1.5454545454545454) internal successors, (510), 332 states have internal predecessors, (510), 0 states have call successors, (0), 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 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:02,130 INFO L93 Difference]: Finished difference Result 900 states and 1381 transitions. [2022-01-11 06:05:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:02,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:02,147 INFO L225 Difference]: With dead ends: 900 [2022-01-11 06:05:02,151 INFO L226 Difference]: Without dead ends: 569 [2022-01-11 06:05:02,157 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 06:05:02,161 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 437 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 888 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 06:05:02,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 888 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-01-11 06:05:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 565. [2022-01-11 06:05:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 563 states have (on average 1.4991119005328597) internal successors, (844), 564 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 844 transitions. [2022-01-11 06:05:02,260 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 844 transitions. Word has length 65 [2022-01-11 06:05:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:02,261 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 844 transitions. [2022-01-11 06:05:02,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 844 transitions. [2022-01-11 06:05:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:02,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:02,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:02,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 06:05:02,268 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1547867353, now seen corresponding path program 1 times [2022-01-11 06:05:02,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:02,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258724577] [2022-01-11 06:05:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:02,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:02,364 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 06:05:02,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:02,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258724577] [2022-01-11 06:05:02,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258724577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:02,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:02,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:02,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848342591] [2022-01-11 06:05:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:02,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:02,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:02,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:02,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:02,368 INFO L87 Difference]: Start difference. First operand 565 states and 844 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:02,403 INFO L93 Difference]: Finished difference Result 1119 states and 1672 transitions. [2022-01-11 06:05:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:02,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:02,407 INFO L225 Difference]: With dead ends: 1119 [2022-01-11 06:05:02,407 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 06:05:02,414 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 06:05:02,415 INFO L933 BasicCegarLoop]: 478 mSDtfsCounter, 473 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 478 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 06:05:02,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [473 Valid, 478 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 06:05:02,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-11 06:05:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 563 states have (on average 1.4849023090586146) internal successors, (836), 564 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 836 transitions. [2022-01-11 06:05:02,461 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 836 transitions. Word has length 65 [2022-01-11 06:05:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:02,462 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 836 transitions. [2022-01-11 06:05:02,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 836 transitions. [2022-01-11 06:05:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:02,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:02,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:02,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 06:05:02,471 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash 203203769, now seen corresponding path program 1 times [2022-01-11 06:05:02,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:02,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565960471] [2022-01-11 06:05:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:02,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:02,550 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 06:05:02,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:02,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565960471] [2022-01-11 06:05:02,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565960471] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:02,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:02,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:02,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771940870] [2022-01-11 06:05:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:02,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:02,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:02,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:02,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:02,554 INFO L87 Difference]: Start difference. First operand 565 states and 836 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:02,588 INFO L93 Difference]: Finished difference Result 1118 states and 1655 transitions. [2022-01-11 06:05:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:02,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:02,591 INFO L225 Difference]: With dead ends: 1118 [2022-01-11 06:05:02,591 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 06:05:02,594 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 06:05:02,599 INFO L933 BasicCegarLoop]: 473 mSDtfsCounter, 467 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 473 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 06:05:02,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 473 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 06:05:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-11 06:05:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 563 states have (on average 1.4706927175843694) internal successors, (828), 564 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 828 transitions. [2022-01-11 06:05:02,629 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 828 transitions. Word has length 65 [2022-01-11 06:05:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:02,629 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 828 transitions. [2022-01-11 06:05:02,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 828 transitions. [2022-01-11 06:05:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:02,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:02,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:02,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 06:05:02,631 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:02,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 852564185, now seen corresponding path program 1 times [2022-01-11 06:05:02,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:02,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427124029] [2022-01-11 06:05:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:02,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:02,686 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 06:05:02,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:02,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427124029] [2022-01-11 06:05:02,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427124029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:02,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:02,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:02,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599259931] [2022-01-11 06:05:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:02,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:02,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:02,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:02,688 INFO L87 Difference]: Start difference. First operand 565 states and 828 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:02,731 INFO L93 Difference]: Finished difference Result 1117 states and 1638 transitions. [2022-01-11 06:05:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:02,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:02,734 INFO L225 Difference]: With dead ends: 1117 [2022-01-11 06:05:02,734 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 06:05:02,735 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 06:05:02,741 INFO L933 BasicCegarLoop]: 468 mSDtfsCounter, 461 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 468 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 06:05:02,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 468 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 06:05:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-11 06:05:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 563 states have (on average 1.4564831261101243) internal successors, (820), 564 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 820 transitions. [2022-01-11 06:05:02,772 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 820 transitions. Word has length 65 [2022-01-11 06:05:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:02,774 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 820 transitions. [2022-01-11 06:05:02,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 820 transitions. [2022-01-11 06:05:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:02,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:02,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:02,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 06:05:02,775 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:02,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1481793351, now seen corresponding path program 1 times [2022-01-11 06:05:02,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:02,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354111760] [2022-01-11 06:05:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:02,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:02,873 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 06:05:02,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:02,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354111760] [2022-01-11 06:05:02,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354111760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:02,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:02,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:02,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296683864] [2022-01-11 06:05:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:02,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:02,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:02,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:02,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:02,876 INFO L87 Difference]: Start difference. First operand 565 states and 820 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:02,933 INFO L93 Difference]: Finished difference Result 1116 states and 1621 transitions. [2022-01-11 06:05:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:02,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:02,936 INFO L225 Difference]: With dead ends: 1116 [2022-01-11 06:05:02,936 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 06:05:02,937 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 06:05:02,938 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 407 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 489 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 06:05:02,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 489 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 06:05:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-11 06:05:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 563 states have (on average 1.4245115452930728) internal successors, (802), 564 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 802 transitions. [2022-01-11 06:05:02,964 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 802 transitions. Word has length 65 [2022-01-11 06:05:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:02,965 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 802 transitions. [2022-01-11 06:05:02,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 802 transitions. [2022-01-11 06:05:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:02,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:02,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:02,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 06:05:02,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1952850344, now seen corresponding path program 1 times [2022-01-11 06:05:02,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:02,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980744916] [2022-01-11 06:05:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:02,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:03,026 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 06:05:03,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:03,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980744916] [2022-01-11 06:05:03,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980744916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:03,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:03,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:03,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227992106] [2022-01-11 06:05:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:03,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:03,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:03,029 INFO L87 Difference]: Start difference. First operand 565 states and 802 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:03,109 INFO L93 Difference]: Finished difference Result 1115 states and 1584 transitions. [2022-01-11 06:05:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:03,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:03,113 INFO L225 Difference]: With dead ends: 1115 [2022-01-11 06:05:03,113 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 06:05:03,114 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 06:05:03,116 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 396 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 477 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 06:05:03,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 477 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 06:05:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-11 06:05:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 563 states have (on average 1.3925399644760212) internal successors, (784), 564 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 784 transitions. [2022-01-11 06:05:03,143 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 784 transitions. Word has length 65 [2022-01-11 06:05:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:03,143 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 784 transitions. [2022-01-11 06:05:03,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 784 transitions. [2022-01-11 06:05:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:03,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:03,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:03,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 06:05:03,144 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -829232393, now seen corresponding path program 1 times [2022-01-11 06:05:03,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:03,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914898675] [2022-01-11 06:05:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:03,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:03,185 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 06:05:03,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:03,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914898675] [2022-01-11 06:05:03,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914898675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:03,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:03,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:03,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578599599] [2022-01-11 06:05:03,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:03,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:03,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:03,187 INFO L87 Difference]: Start difference. First operand 565 states and 784 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:03,234 INFO L93 Difference]: Finished difference Result 1114 states and 1547 transitions. [2022-01-11 06:05:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:03,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:03,237 INFO L225 Difference]: With dead ends: 1114 [2022-01-11 06:05:03,237 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 06:05:03,238 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 06:05:03,240 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 385 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 465 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 06:05:03,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [385 Valid, 465 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 06:05:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-01-11 06:05:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 563 states have (on average 1.3605683836589697) internal successors, (766), 564 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 766 transitions. [2022-01-11 06:05:03,270 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 766 transitions. Word has length 65 [2022-01-11 06:05:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:03,271 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 766 transitions. [2022-01-11 06:05:03,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 766 transitions. [2022-01-11 06:05:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:03,271 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:03,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:03,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 06:05:03,272 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:03,272 INFO L85 PathProgramCache]: Analyzing trace with hash -234965226, now seen corresponding path program 1 times [2022-01-11 06:05:03,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:03,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555984418] [2022-01-11 06:05:03,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:03,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:03,340 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 06:05:03,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:03,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555984418] [2022-01-11 06:05:03,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555984418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:03,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:03,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:05:03,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892166320] [2022-01-11 06:05:03,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:03,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:05:03,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:03,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:05:03,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:05:03,343 INFO L87 Difference]: Start difference. First operand 565 states and 766 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:03,505 INFO L93 Difference]: Finished difference Result 1475 states and 2022 transitions. [2022-01-11 06:05:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:05:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:03,510 INFO L225 Difference]: With dead ends: 1475 [2022-01-11 06:05:03,510 INFO L226 Difference]: Without dead ends: 941 [2022-01-11 06:05:03,511 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 06:05:03,512 INFO L933 BasicCegarLoop]: 460 mSDtfsCounter, 1103 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:03,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1103 Valid, 1315 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 06:05:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-01-11 06:05:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 571. [2022-01-11 06:05:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 569 states have (on average 1.3391915641476275) internal successors, (762), 570 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 762 transitions. [2022-01-11 06:05:03,551 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 762 transitions. Word has length 65 [2022-01-11 06:05:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:03,552 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 762 transitions. [2022-01-11 06:05:03,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 762 transitions. [2022-01-11 06:05:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:03,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:03,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:03,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 06:05:03,553 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash 94800535, now seen corresponding path program 1 times [2022-01-11 06:05:03,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:03,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618771378] [2022-01-11 06:05:03,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:03,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:03,590 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 06:05:03,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618771378] [2022-01-11 06:05:03,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618771378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:03,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:03,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:03,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869665558] [2022-01-11 06:05:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:03,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:03,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:03,593 INFO L87 Difference]: Start difference. First operand 571 states and 762 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:03,699 INFO L93 Difference]: Finished difference Result 1544 states and 2062 transitions. [2022-01-11 06:05:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:03,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:03,703 INFO L225 Difference]: With dead ends: 1544 [2022-01-11 06:05:03,703 INFO L226 Difference]: Without dead ends: 1013 [2022-01-11 06:05:03,704 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 06:05:03,706 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 336 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:03,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 772 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-01-11 06:05:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1005. [2022-01-11 06:05:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 1003 states have (on average 1.3290129611166501) internal successors, (1333), 1004 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1333 transitions. [2022-01-11 06:05:03,772 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1333 transitions. Word has length 65 [2022-01-11 06:05:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:03,772 INFO L470 AbstractCegarLoop]: Abstraction has 1005 states and 1333 transitions. [2022-01-11 06:05:03,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1333 transitions. [2022-01-11 06:05:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:03,773 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:03,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:03,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 06:05:03,773 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash 278429142, now seen corresponding path program 1 times [2022-01-11 06:05:03,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:03,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570006310] [2022-01-11 06:05:03,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:03,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:03,813 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 06:05:03,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570006310] [2022-01-11 06:05:03,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570006310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:03,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:03,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:03,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083619688] [2022-01-11 06:05:03,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:03,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:03,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:03,815 INFO L87 Difference]: Start difference. First operand 1005 states and 1333 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:03,898 INFO L93 Difference]: Finished difference Result 1993 states and 2644 transitions. [2022-01-11 06:05:03,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:03,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:03,903 INFO L225 Difference]: With dead ends: 1993 [2022-01-11 06:05:03,903 INFO L226 Difference]: Without dead ends: 1005 [2022-01-11 06:05:03,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:03,905 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 334 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:03,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 445 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-01-11 06:05:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1005. [2022-01-11 06:05:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 1003 states have (on average 1.3060817547357926) internal successors, (1310), 1004 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1310 transitions. [2022-01-11 06:05:03,974 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1310 transitions. Word has length 65 [2022-01-11 06:05:03,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:03,974 INFO L470 AbstractCegarLoop]: Abstraction has 1005 states and 1310 transitions. [2022-01-11 06:05:03,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1310 transitions. [2022-01-11 06:05:03,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-11 06:05:03,975 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:03,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:03,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 06:05:03,976 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash -232105035, now seen corresponding path program 1 times [2022-01-11 06:05:03,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:03,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097277738] [2022-01-11 06:05:03,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:03,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:04,033 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 06:05:04,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:04,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097277738] [2022-01-11 06:05:04,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097277738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:04,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:04,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:04,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034166644] [2022-01-11 06:05:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:04,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:04,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:04,035 INFO L87 Difference]: Start difference. First operand 1005 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:04,201 INFO L93 Difference]: Finished difference Result 2885 states and 3757 transitions. [2022-01-11 06:05:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:04,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-01-11 06:05:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:04,209 INFO L225 Difference]: With dead ends: 2885 [2022-01-11 06:05:04,209 INFO L226 Difference]: Without dead ends: 1899 [2022-01-11 06:05:04,211 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 06:05:04,212 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 326 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:04,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 751 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-01-11 06:05:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1781. [2022-01-11 06:05:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1779 states have (on average 1.2917369308600337) internal successors, (2298), 1780 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2298 transitions. [2022-01-11 06:05:04,324 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2298 transitions. Word has length 65 [2022-01-11 06:05:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:04,325 INFO L470 AbstractCegarLoop]: Abstraction has 1781 states and 2298 transitions. [2022-01-11 06:05:04,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2298 transitions. [2022-01-11 06:05:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 06:05:04,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:04,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:04,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 06:05:04,328 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -441811552, now seen corresponding path program 1 times [2022-01-11 06:05:04,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:04,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704826792] [2022-01-11 06:05:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:04,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:04,388 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 06:05:04,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:04,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704826792] [2022-01-11 06:05:04,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704826792] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:04,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:04,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:04,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395017291] [2022-01-11 06:05:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:04,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:04,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:04,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:04,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:04,390 INFO L87 Difference]: Start difference. First operand 1781 states and 2298 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 06:05:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:04,676 INFO L93 Difference]: Finished difference Result 5140 states and 6648 transitions. [2022-01-11 06:05:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:04,677 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 105 [2022-01-11 06:05:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:04,689 INFO L225 Difference]: With dead ends: 5140 [2022-01-11 06:05:04,689 INFO L226 Difference]: Without dead ends: 3384 [2022-01-11 06:05:04,692 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 06:05:04,693 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 342 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:04,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 748 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2022-01-11 06:05:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3208. [2022-01-11 06:05:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3206 states have (on average 1.2894572676232066) internal successors, (4134), 3207 states have internal predecessors, (4134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4134 transitions. [2022-01-11 06:05:04,905 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4134 transitions. Word has length 105 [2022-01-11 06:05:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:04,905 INFO L470 AbstractCegarLoop]: Abstraction has 3208 states and 4134 transitions. [2022-01-11 06:05:04,905 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 06:05:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4134 transitions. [2022-01-11 06:05:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 06:05:04,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:04,908 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:04,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 06:05:04,908 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -609514016, now seen corresponding path program 1 times [2022-01-11 06:05:04,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:04,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833893127] [2022-01-11 06:05:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:04,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:04,963 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 06:05:04,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:04,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833893127] [2022-01-11 06:05:04,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833893127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:04,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:04,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:04,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217891832] [2022-01-11 06:05:04,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:04,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:04,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:04,965 INFO L87 Difference]: Start difference. First operand 3208 states and 4134 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 06:05:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:05,299 INFO L93 Difference]: Finished difference Result 9166 states and 11742 transitions. [2022-01-11 06:05:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:05,300 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 105 [2022-01-11 06:05:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:05,322 INFO L225 Difference]: With dead ends: 9166 [2022-01-11 06:05:05,322 INFO L226 Difference]: Without dead ends: 6010 [2022-01-11 06:05:05,328 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 06:05:05,329 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 267 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:05,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 945 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2022-01-11 06:05:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 6006. [2022-01-11 06:05:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6006 states, 6004 states have (on average 1.2661558960692871) internal successors, (7602), 6005 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6006 states to 6006 states and 7602 transitions. [2022-01-11 06:05:05,697 INFO L78 Accepts]: Start accepts. Automaton has 6006 states and 7602 transitions. Word has length 105 [2022-01-11 06:05:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:05,697 INFO L470 AbstractCegarLoop]: Abstraction has 6006 states and 7602 transitions. [2022-01-11 06:05:05,697 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 06:05:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 6006 states and 7602 transitions. [2022-01-11 06:05:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-11 06:05:05,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:05,701 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:05,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 06:05:05,701 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:05,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1808249281, now seen corresponding path program 1 times [2022-01-11 06:05:05,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:05,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304778416] [2022-01-11 06:05:05,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:05,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:05,724 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 06:05:05,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304778416] [2022-01-11 06:05:05,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304778416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:05,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:05,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:05,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80116205] [2022-01-11 06:05:05,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:05,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:05,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:05,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:05,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:05,726 INFO L87 Difference]: Start difference. First operand 6006 states and 7602 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:06,046 INFO L93 Difference]: Finished difference Result 11914 states and 15092 transitions. [2022-01-11 06:05:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:06,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 06:05:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:06,070 INFO L225 Difference]: With dead ends: 11914 [2022-01-11 06:05:06,070 INFO L226 Difference]: Without dead ends: 5960 [2022-01-11 06:05:06,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:06,082 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 411 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 415 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 06:05:06,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 415 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2022-01-11 06:05:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5960. [2022-01-11 06:05:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5960 states, 5958 states have (on average 1.26703591809332) internal successors, (7549), 5959 states have internal predecessors, (7549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5960 states to 5960 states and 7549 transitions. [2022-01-11 06:05:06,482 INFO L78 Accepts]: Start accepts. Automaton has 5960 states and 7549 transitions. Word has length 105 [2022-01-11 06:05:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:06,482 INFO L470 AbstractCegarLoop]: Abstraction has 5960 states and 7549 transitions. [2022-01-11 06:05:06,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5960 states and 7549 transitions. [2022-01-11 06:05:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 06:05:06,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:06,486 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:06,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 06:05:06,486 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1443212652, now seen corresponding path program 1 times [2022-01-11 06:05:06,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:06,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210840081] [2022-01-11 06:05:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:06,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:06,536 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 06:05:06,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:06,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210840081] [2022-01-11 06:05:06,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210840081] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:06,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:06,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:06,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645627705] [2022-01-11 06:05:06,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:06,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:06,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:06,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:06,538 INFO L87 Difference]: Start difference. First operand 5960 states and 7549 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:07,034 INFO L93 Difference]: Finished difference Result 17005 states and 21491 transitions. [2022-01-11 06:05:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-11 06:05:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:07,070 INFO L225 Difference]: With dead ends: 17005 [2022-01-11 06:05:07,070 INFO L226 Difference]: Without dead ends: 11097 [2022-01-11 06:05:07,085 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 06:05:07,085 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 352 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:07,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 911 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11097 states. [2022-01-11 06:05:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11097 to 10757. [2022-01-11 06:05:07,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10757 states, 10755 states have (on average 1.2569967456996747) internal successors, (13519), 10756 states have internal predecessors, (13519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10757 states to 10757 states and 13519 transitions. [2022-01-11 06:05:07,676 INFO L78 Accepts]: Start accepts. Automaton has 10757 states and 13519 transitions. Word has length 106 [2022-01-11 06:05:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:07,677 INFO L470 AbstractCegarLoop]: Abstraction has 10757 states and 13519 transitions. [2022-01-11 06:05:07,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10757 states and 13519 transitions. [2022-01-11 06:05:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 06:05:07,682 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:07,682 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:07,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 06:05:07,682 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -424994063, now seen corresponding path program 1 times [2022-01-11 06:05:07,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:07,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660034652] [2022-01-11 06:05:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:07,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:07,711 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 06:05:07,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:07,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660034652] [2022-01-11 06:05:07,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660034652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:07,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:07,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:07,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229519837] [2022-01-11 06:05:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:07,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:07,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:07,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:07,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:07,715 INFO L87 Difference]: Start difference. First operand 10757 states and 13519 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:08,284 INFO L93 Difference]: Finished difference Result 21433 states and 26946 transitions. [2022-01-11 06:05:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-11 06:05:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:08,311 INFO L225 Difference]: With dead ends: 21433 [2022-01-11 06:05:08,311 INFO L226 Difference]: Without dead ends: 10712 [2022-01-11 06:05:08,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:08,330 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 409 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 414 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 06:05:08,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 414 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10712 states. [2022-01-11 06:05:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10712 to 10712. [2022-01-11 06:05:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10712 states, 10710 states have (on average 1.257516339869281) internal successors, (13468), 10711 states have internal predecessors, (13468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10712 states to 10712 states and 13468 transitions. [2022-01-11 06:05:08,845 INFO L78 Accepts]: Start accepts. Automaton has 10712 states and 13468 transitions. Word has length 106 [2022-01-11 06:05:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:08,845 INFO L470 AbstractCegarLoop]: Abstraction has 10712 states and 13468 transitions. [2022-01-11 06:05:08,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10712 states and 13468 transitions. [2022-01-11 06:05:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 06:05:08,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:08,849 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:08,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 06:05:08,849 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:08,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1787226539, now seen corresponding path program 1 times [2022-01-11 06:05:08,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:08,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441865179] [2022-01-11 06:05:08,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:08,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:08,903 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 06:05:08,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:08,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441865179] [2022-01-11 06:05:08,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441865179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:08,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:08,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:08,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381442916] [2022-01-11 06:05:08,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:08,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:08,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:08,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:08,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:08,905 INFO L87 Difference]: Start difference. First operand 10712 states and 13468 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:09,742 INFO L93 Difference]: Finished difference Result 31020 states and 38944 transitions. [2022-01-11 06:05:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-11 06:05:09,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:09,791 INFO L225 Difference]: With dead ends: 31020 [2022-01-11 06:05:09,792 INFO L226 Difference]: Without dead ends: 20360 [2022-01-11 06:05:09,888 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 06:05:09,889 INFO L933 BasicCegarLoop]: 490 mSDtfsCounter, 305 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:09,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [305 Valid, 877 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2022-01-11 06:05:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20228. [2022-01-11 06:05:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20228 states, 20226 states have (on average 1.250469692475032) internal successors, (25292), 20227 states have internal predecessors, (25292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20228 states to 20228 states and 25292 transitions. [2022-01-11 06:05:10,792 INFO L78 Accepts]: Start accepts. Automaton has 20228 states and 25292 transitions. Word has length 107 [2022-01-11 06:05:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:10,792 INFO L470 AbstractCegarLoop]: Abstraction has 20228 states and 25292 transitions. [2022-01-11 06:05:10,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20228 states and 25292 transitions. [2022-01-11 06:05:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 06:05:10,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:10,799 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:10,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 06:05:10,800 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 700928629, now seen corresponding path program 1 times [2022-01-11 06:05:10,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:10,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110569923] [2022-01-11 06:05:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:10,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:10,825 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 06:05:10,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:10,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110569923] [2022-01-11 06:05:10,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110569923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:10,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:10,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:10,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953336944] [2022-01-11 06:05:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:10,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:10,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:10,828 INFO L87 Difference]: Start difference. First operand 20228 states and 25292 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:11,549 INFO L93 Difference]: Finished difference Result 35678 states and 44640 transitions. [2022-01-11 06:05:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:11,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-11 06:05:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:11,578 INFO L225 Difference]: With dead ends: 35678 [2022-01-11 06:05:11,578 INFO L226 Difference]: Without dead ends: 15492 [2022-01-11 06:05:11,605 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 06:05:11,605 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 407 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 413 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 06:05:11,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 413 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:11,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2022-01-11 06:05:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 15492. [2022-01-11 06:05:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15492 states, 15490 states have (on average 1.2520981278244028) internal successors, (19395), 15491 states have internal predecessors, (19395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15492 states to 15492 states and 19395 transitions. [2022-01-11 06:05:12,432 INFO L78 Accepts]: Start accepts. Automaton has 15492 states and 19395 transitions. Word has length 107 [2022-01-11 06:05:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:12,433 INFO L470 AbstractCegarLoop]: Abstraction has 15492 states and 19395 transitions. [2022-01-11 06:05:12,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 15492 states and 19395 transitions. [2022-01-11 06:05:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 06:05:12,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:12,441 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:12,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 06:05:12,442 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1329160227, now seen corresponding path program 1 times [2022-01-11 06:05:12,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:12,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7752894] [2022-01-11 06:05:12,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:12,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:12,482 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 06:05:12,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:12,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7752894] [2022-01-11 06:05:12,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7752894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:12,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:12,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:12,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323994848] [2022-01-11 06:05:12,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:12,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:12,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:12,485 INFO L87 Difference]: Start difference. First operand 15492 states and 19395 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:13,793 INFO L93 Difference]: Finished difference Result 44175 states and 55056 transitions. [2022-01-11 06:05:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-01-11 06:05:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:13,846 INFO L225 Difference]: With dead ends: 44175 [2022-01-11 06:05:13,846 INFO L226 Difference]: Without dead ends: 28735 [2022-01-11 06:05:13,873 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 06:05:13,874 INFO L933 BasicCegarLoop]: 744 mSDtfsCounter, 329 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:13,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 1137 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28735 states. [2022-01-11 06:05:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28735 to 28735. [2022-01-11 06:05:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28735 states, 28733 states have (on average 1.2297358438032924) internal successors, (35334), 28734 states have internal predecessors, (35334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28735 states to 28735 states and 35334 transitions. [2022-01-11 06:05:15,290 INFO L78 Accepts]: Start accepts. Automaton has 28735 states and 35334 transitions. Word has length 108 [2022-01-11 06:05:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:15,290 INFO L470 AbstractCegarLoop]: Abstraction has 28735 states and 35334 transitions. [2022-01-11 06:05:15,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 28735 states and 35334 transitions. [2022-01-11 06:05:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-11 06:05:15,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:15,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:15,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 06:05:15,311 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1346622180, now seen corresponding path program 1 times [2022-01-11 06:05:15,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:15,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563173823] [2022-01-11 06:05:15,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:15,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:15,357 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 06:05:15,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:15,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563173823] [2022-01-11 06:05:15,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563173823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:15,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:15,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:05:15,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565093099] [2022-01-11 06:05:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:15,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:15,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:15,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:15,360 INFO L87 Difference]: Start difference. First operand 28735 states and 35334 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:17,087 INFO L93 Difference]: Finished difference Result 70155 states and 86218 transitions. [2022-01-11 06:05:17,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:17,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-01-11 06:05:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:17,280 INFO L225 Difference]: With dead ends: 70155 [2022-01-11 06:05:17,280 INFO L226 Difference]: Without dead ends: 41477 [2022-01-11 06:05:17,306 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 06:05:17,307 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 254 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:17,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 745 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41477 states. [2022-01-11 06:05:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41477 to 41281. [2022-01-11 06:05:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41281 states, 41279 states have (on average 1.2216865718646286) internal successors, (50430), 41280 states have internal predecessors, (50430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41281 states to 41281 states and 50430 transitions. [2022-01-11 06:05:19,371 INFO L78 Accepts]: Start accepts. Automaton has 41281 states and 50430 transitions. Word has length 139 [2022-01-11 06:05:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:19,372 INFO L470 AbstractCegarLoop]: Abstraction has 41281 states and 50430 transitions. [2022-01-11 06:05:19,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 41281 states and 50430 transitions. [2022-01-11 06:05:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-01-11 06:05:19,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:19,401 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:19,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 06:05:19,401 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1263420023, now seen corresponding path program 1 times [2022-01-11 06:05:19,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:19,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921669560] [2022-01-11 06:05:19,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:19,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-11 06:05:19,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:19,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921669560] [2022-01-11 06:05:19,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921669560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:19,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:19,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:19,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684111614] [2022-01-11 06:05:19,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:19,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:19,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:19,544 INFO L87 Difference]: Start difference. First operand 41281 states and 50430 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:21,356 INFO L93 Difference]: Finished difference Result 74051 states and 90638 transitions. [2022-01-11 06:05:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 156 [2022-01-11 06:05:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:21,413 INFO L225 Difference]: With dead ends: 74051 [2022-01-11 06:05:21,413 INFO L226 Difference]: Without dead ends: 42241 [2022-01-11 06:05:21,453 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 06:05:21,454 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 314 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:21,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 805 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42241 states. [2022-01-11 06:05:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42241 to 40561. [2022-01-11 06:05:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40561 states, 40559 states have (on average 1.2037279025617003) internal successors, (48822), 40560 states have internal predecessors, (48822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40561 states to 40561 states and 48822 transitions. [2022-01-11 06:05:23,332 INFO L78 Accepts]: Start accepts. Automaton has 40561 states and 48822 transitions. Word has length 156 [2022-01-11 06:05:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:23,332 INFO L470 AbstractCegarLoop]: Abstraction has 40561 states and 48822 transitions. [2022-01-11 06:05:23,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 40561 states and 48822 transitions. [2022-01-11 06:05:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 06:05:23,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:23,358 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:23,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 06:05:23,358 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash -961804767, now seen corresponding path program 1 times [2022-01-11 06:05:23,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:23,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897973424] [2022-01-11 06:05:23,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:23,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 06:05:23,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:23,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897973424] [2022-01-11 06:05:23,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897973424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:23,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:23,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:23,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483628314] [2022-01-11 06:05:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:23,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:23,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:23,401 INFO L87 Difference]: Start difference. First operand 40561 states and 48822 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:25,208 INFO L93 Difference]: Finished difference Result 75601 states and 91058 transitions. [2022-01-11 06:05:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:25,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-11 06:05:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:25,257 INFO L225 Difference]: With dead ends: 75601 [2022-01-11 06:05:25,257 INFO L226 Difference]: Without dead ends: 35137 [2022-01-11 06:05:25,283 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 06:05:25,284 INFO L933 BasicCegarLoop]: 686 mSDtfsCounter, 298 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:25,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1072 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2022-01-11 06:05:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 35133. [2022-01-11 06:05:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35133 states, 35131 states have (on average 1.1948990919700548) internal successors, (41978), 35132 states have internal predecessors, (41978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35133 states to 35133 states and 41978 transitions. [2022-01-11 06:05:26,879 INFO L78 Accepts]: Start accepts. Automaton has 35133 states and 41978 transitions. Word has length 157 [2022-01-11 06:05:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:26,879 INFO L470 AbstractCegarLoop]: Abstraction has 35133 states and 41978 transitions. [2022-01-11 06:05:26,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 35133 states and 41978 transitions. [2022-01-11 06:05:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 06:05:26,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:26,899 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:26,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 06:05:26,899 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1687137472, now seen corresponding path program 1 times [2022-01-11 06:05:26,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:26,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338163431] [2022-01-11 06:05:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:26,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:05:26,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:26,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338163431] [2022-01-11 06:05:26,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338163431] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:26,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:26,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:26,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334029011] [2022-01-11 06:05:26,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:26,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:26,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:26,946 INFO L87 Difference]: Start difference. First operand 35133 states and 41978 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:28,708 INFO L93 Difference]: Finished difference Result 59505 states and 71306 transitions. [2022-01-11 06:05:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:28,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-11 06:05:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:28,764 INFO L225 Difference]: With dead ends: 59505 [2022-01-11 06:05:28,764 INFO L226 Difference]: Without dead ends: 35137 [2022-01-11 06:05:28,781 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 06:05:28,782 INFO L933 BasicCegarLoop]: 698 mSDtfsCounter, 289 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:28,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 1084 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2022-01-11 06:05:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 35133. [2022-01-11 06:05:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35133 states, 35131 states have (on average 1.190458569354701) internal successors, (41822), 35132 states have internal predecessors, (41822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35133 states to 35133 states and 41822 transitions. [2022-01-11 06:05:30,242 INFO L78 Accepts]: Start accepts. Automaton has 35133 states and 41822 transitions. Word has length 157 [2022-01-11 06:05:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:30,242 INFO L470 AbstractCegarLoop]: Abstraction has 35133 states and 41822 transitions. [2022-01-11 06:05:30,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 35133 states and 41822 transitions. [2022-01-11 06:05:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 06:05:30,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:30,378 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:30,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 06:05:30,378 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash -636849767, now seen corresponding path program 1 times [2022-01-11 06:05:30,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:30,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709019410] [2022-01-11 06:05:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:30,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:05:30,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709019410] [2022-01-11 06:05:30,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709019410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:30,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:30,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:30,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563626273] [2022-01-11 06:05:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:30,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:30,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:30,438 INFO L87 Difference]: Start difference. First operand 35133 states and 41822 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:31,994 INFO L93 Difference]: Finished difference Result 59481 states and 71006 transitions. [2022-01-11 06:05:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-11 06:05:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:32,051 INFO L225 Difference]: With dead ends: 59481 [2022-01-11 06:05:32,051 INFO L226 Difference]: Without dead ends: 35137 [2022-01-11 06:05:32,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:32,075 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 289 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:32,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 1093 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35137 states. [2022-01-11 06:05:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35137 to 35133. [2022-01-11 06:05:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35133 states, 35131 states have (on average 1.187384361390225) internal successors, (41714), 35132 states have internal predecessors, (41714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35133 states to 35133 states and 41714 transitions. [2022-01-11 06:05:33,635 INFO L78 Accepts]: Start accepts. Automaton has 35133 states and 41714 transitions. Word has length 157 [2022-01-11 06:05:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:33,636 INFO L470 AbstractCegarLoop]: Abstraction has 35133 states and 41714 transitions. [2022-01-11 06:05:33,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35133 states and 41714 transitions. [2022-01-11 06:05:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 06:05:33,649 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:33,649 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:33,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 06:05:33,649 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:33,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash -570947613, now seen corresponding path program 1 times [2022-01-11 06:05:33,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:33,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527593542] [2022-01-11 06:05:33,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:33,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 06:05:33,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:33,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527593542] [2022-01-11 06:05:33,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527593542] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:33,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:33,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:33,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420247620] [2022-01-11 06:05:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:33,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:33,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:33,695 INFO L87 Difference]: Start difference. First operand 35133 states and 41714 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:35,435 INFO L93 Difference]: Finished difference Result 58727 states and 70190 transitions. [2022-01-11 06:05:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:35,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-11 06:05:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:35,483 INFO L225 Difference]: With dead ends: 58727 [2022-01-11 06:05:35,483 INFO L226 Difference]: Without dead ends: 36795 [2022-01-11 06:05:35,509 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 06:05:35,510 INFO L933 BasicCegarLoop]: 610 mSDtfsCounter, 342 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:35,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 945 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36795 states. [2022-01-11 06:05:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36795 to 35079. [2022-01-11 06:05:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35079 states, 35077 states have (on average 1.1715939219431537) internal successors, (41096), 35078 states have internal predecessors, (41096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35079 states to 35079 states and 41096 transitions. [2022-01-11 06:05:37,145 INFO L78 Accepts]: Start accepts. Automaton has 35079 states and 41096 transitions. Word has length 157 [2022-01-11 06:05:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:37,145 INFO L470 AbstractCegarLoop]: Abstraction has 35079 states and 41096 transitions. [2022-01-11 06:05:37,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35079 states and 41096 transitions. [2022-01-11 06:05:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 06:05:37,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:37,160 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:37,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 06:05:37,161 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:37,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash 459807108, now seen corresponding path program 1 times [2022-01-11 06:05:37,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:37,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093450867] [2022-01-11 06:05:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:37,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:05:37,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:37,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093450867] [2022-01-11 06:05:37,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093450867] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:37,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:37,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:37,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401921270] [2022-01-11 06:05:37,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:37,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:37,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:37,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:37,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:37,204 INFO L87 Difference]: Start difference. First operand 35079 states and 41096 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:38,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:38,859 INFO L93 Difference]: Finished difference Result 59559 states and 69912 transitions. [2022-01-11 06:05:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:38,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-11 06:05:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:38,912 INFO L225 Difference]: With dead ends: 59559 [2022-01-11 06:05:38,912 INFO L226 Difference]: Without dead ends: 35251 [2022-01-11 06:05:38,934 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 06:05:38,935 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 316 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:38,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 1036 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35251 states. [2022-01-11 06:05:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35251 to 35079. [2022-01-11 06:05:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35079 states, 35077 states have (on average 1.1535764175955754) internal successors, (40464), 35078 states have internal predecessors, (40464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35079 states to 35079 states and 40464 transitions. [2022-01-11 06:05:40,603 INFO L78 Accepts]: Start accepts. Automaton has 35079 states and 40464 transitions. Word has length 157 [2022-01-11 06:05:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:40,604 INFO L470 AbstractCegarLoop]: Abstraction has 35079 states and 40464 transitions. [2022-01-11 06:05:40,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 35079 states and 40464 transitions. [2022-01-11 06:05:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 06:05:40,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:40,622 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:40,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 06:05:40,623 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash 879825772, now seen corresponding path program 1 times [2022-01-11 06:05:40,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306447579] [2022-01-11 06:05:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:40,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:05:40,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:40,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306447579] [2022-01-11 06:05:40,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306447579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:40,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:40,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:40,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170671249] [2022-01-11 06:05:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:40,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:40,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:40,672 INFO L87 Difference]: Start difference. First operand 35079 states and 40464 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:41,992 INFO L93 Difference]: Finished difference Result 51827 states and 60052 transitions. [2022-01-11 06:05:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-11 06:05:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:42,032 INFO L225 Difference]: With dead ends: 51827 [2022-01-11 06:05:42,032 INFO L226 Difference]: Without dead ends: 25763 [2022-01-11 06:05:42,056 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 06:05:42,057 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 290 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:42,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 1008 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25763 states. [2022-01-11 06:05:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25763 to 25687. [2022-01-11 06:05:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25687 states, 25685 states have (on average 1.1449484134708974) internal successors, (29408), 25686 states have internal predecessors, (29408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25687 states to 25687 states and 29408 transitions. [2022-01-11 06:05:43,352 INFO L78 Accepts]: Start accepts. Automaton has 25687 states and 29408 transitions. Word has length 158 [2022-01-11 06:05:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:43,352 INFO L470 AbstractCegarLoop]: Abstraction has 25687 states and 29408 transitions. [2022-01-11 06:05:43,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25687 states and 29408 transitions. [2022-01-11 06:05:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 06:05:43,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:43,363 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:43,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 06:05:43,363 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 309120596, now seen corresponding path program 1 times [2022-01-11 06:05:43,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:43,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986372138] [2022-01-11 06:05:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:43,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:05:43,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:43,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986372138] [2022-01-11 06:05:43,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986372138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:43,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:43,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:43,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396635049] [2022-01-11 06:05:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:43,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:43,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:43,418 INFO L87 Difference]: Start difference. First operand 25687 states and 29408 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:44,709 INFO L93 Difference]: Finished difference Result 43595 states and 50004 transitions. [2022-01-11 06:05:44,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-11 06:05:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:44,750 INFO L225 Difference]: With dead ends: 43595 [2022-01-11 06:05:44,750 INFO L226 Difference]: Without dead ends: 25811 [2022-01-11 06:05:44,767 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 06:05:44,767 INFO L933 BasicCegarLoop]: 680 mSDtfsCounter, 317 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:44,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 1015 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25811 states. [2022-01-11 06:05:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25811 to 25687. [2022-01-11 06:05:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25687 states, 25685 states have (on average 1.1270391278956589) internal successors, (28948), 25686 states have internal predecessors, (28948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25687 states to 25687 states and 28948 transitions. [2022-01-11 06:05:46,040 INFO L78 Accepts]: Start accepts. Automaton has 25687 states and 28948 transitions. Word has length 158 [2022-01-11 06:05:46,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:46,040 INFO L470 AbstractCegarLoop]: Abstraction has 25687 states and 28948 transitions. [2022-01-11 06:05:46,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 25687 states and 28948 transitions. [2022-01-11 06:05:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-11 06:05:46,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:46,050 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:46,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 06:05:46,050 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 552701124, now seen corresponding path program 1 times [2022-01-11 06:05:46,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:46,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511102167] [2022-01-11 06:05:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:46,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-11 06:05:46,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:46,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511102167] [2022-01-11 06:05:46,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511102167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:46,107 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:46,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:05:46,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140631714] [2022-01-11 06:05:46,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:46,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:05:46,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:46,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:05:46,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:05:46,108 INFO L87 Difference]: Start difference. First operand 25687 states and 28948 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:47,644 INFO L93 Difference]: Finished difference Result 47763 states and 53961 transitions. [2022-01-11 06:05:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:05:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 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 159 [2022-01-11 06:05:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:47,680 INFO L225 Difference]: With dead ends: 47763 [2022-01-11 06:05:47,681 INFO L226 Difference]: Without dead ends: 22099 [2022-01-11 06:05:47,699 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 06:05:47,700 INFO L933 BasicCegarLoop]: 451 mSDtfsCounter, 1089 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:47,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1089 Valid, 1045 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 06:05:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22099 states. [2022-01-11 06:05:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22099 to 18825. [2022-01-11 06:05:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18825 states, 18823 states have (on average 1.1091749455453435) internal successors, (20878), 18824 states have internal predecessors, (20878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18825 states to 18825 states and 20878 transitions. [2022-01-11 06:05:48,783 INFO L78 Accepts]: Start accepts. Automaton has 18825 states and 20878 transitions. Word has length 159 [2022-01-11 06:05:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:48,783 INFO L470 AbstractCegarLoop]: Abstraction has 18825 states and 20878 transitions. [2022-01-11 06:05:48,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18825 states and 20878 transitions. [2022-01-11 06:05:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-11 06:05:48,790 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:48,791 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:05:48,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 06:05:48,791 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash 680074199, now seen corresponding path program 1 times [2022-01-11 06:05:48,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257428894] [2022-01-11 06:05:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:48,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-11 06:05:48,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:48,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257428894] [2022-01-11 06:05:48,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257428894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:48,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:48,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:05:48,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833369954] [2022-01-11 06:05:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:48,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:05:48,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:05:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:05:48,877 INFO L87 Difference]: Start difference. First operand 18825 states and 20878 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:50,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:50,079 INFO L93 Difference]: Finished difference Result 37772 states and 41905 transitions. [2022-01-11 06:05:50,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:05:50,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 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 159 [2022-01-11 06:05:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:50,100 INFO L225 Difference]: With dead ends: 37772 [2022-01-11 06:05:50,100 INFO L226 Difference]: Without dead ends: 18988 [2022-01-11 06:05:50,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 06:05:50,113 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 860 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:50,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 1186 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 06:05:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2022-01-11 06:05:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 15642. [2022-01-11 06:05:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15642 states, 15640 states have (on average 1.0881713554987211) internal successors, (17019), 15641 states have internal predecessors, (17019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15642 states to 15642 states and 17019 transitions. [2022-01-11 06:05:51,114 INFO L78 Accepts]: Start accepts. Automaton has 15642 states and 17019 transitions. Word has length 159 [2022-01-11 06:05:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:51,115 INFO L470 AbstractCegarLoop]: Abstraction has 15642 states and 17019 transitions. [2022-01-11 06:05:51,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 15642 states and 17019 transitions. [2022-01-11 06:05:51,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-11 06:05:51,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:51,123 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:51,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 06:05:51,123 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:51,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:51,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2046295803, now seen corresponding path program 1 times [2022-01-11 06:05:51,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:51,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575056923] [2022-01-11 06:05:51,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:51,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-11 06:05:51,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:51,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575056923] [2022-01-11 06:05:51,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575056923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:51,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:51,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:05:51,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959657645] [2022-01-11 06:05:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:51,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:05:51,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:51,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:05:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:05:51,191 INFO L87 Difference]: Start difference. First operand 15642 states and 17019 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:51,734 INFO L93 Difference]: Finished difference Result 22271 states and 24144 transitions. [2022-01-11 06:05:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:05:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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 198 [2022-01-11 06:05:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:51,739 INFO L225 Difference]: With dead ends: 22271 [2022-01-11 06:05:51,739 INFO L226 Difference]: Without dead ends: 4026 [2022-01-11 06:05:51,749 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 06:05:51,750 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 888 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:51,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 914 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 06:05:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2022-01-11 06:05:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3830. [2022-01-11 06:05:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3830 states, 3828 states have (on average 1.0564263322884013) internal successors, (4044), 3829 states have internal predecessors, (4044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 4044 transitions. [2022-01-11 06:05:51,988 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 4044 transitions. Word has length 198 [2022-01-11 06:05:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:51,988 INFO L470 AbstractCegarLoop]: Abstraction has 3830 states and 4044 transitions. [2022-01-11 06:05:51,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 4044 transitions. [2022-01-11 06:05:52,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-01-11 06:05:52,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:52,021 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:52,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 06:05:52,022 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:52,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1079320718, now seen corresponding path program 1 times [2022-01-11 06:05:52,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:52,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567662960] [2022-01-11 06:05:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:52,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 06:05:52,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:52,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567662960] [2022-01-11 06:05:52,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567662960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:52,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:52,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 06:05:52,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868042778] [2022-01-11 06:05:52,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:52,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 06:05:52,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 06:05:52,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:05:52,349 INFO L87 Difference]: Start difference. First operand 3830 states and 4044 transitions. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:53,079 INFO L93 Difference]: Finished difference Result 3830 states and 4044 transitions. [2022-01-11 06:05:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:05:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 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 238 [2022-01-11 06:05:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:53,086 INFO L225 Difference]: With dead ends: 3830 [2022-01-11 06:05:53,086 INFO L226 Difference]: Without dead ends: 3828 [2022-01-11 06:05:53,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:05:53,089 INFO L933 BasicCegarLoop]: 734 mSDtfsCounter, 589 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:53,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 2927 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2022-01-11 06:05:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3828. [2022-01-11 06:05:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 3827 states have (on average 1.0559184740005225) internal successors, (4041), 3827 states have internal predecessors, (4041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 4041 transitions. [2022-01-11 06:05:53,723 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 4041 transitions. Word has length 238 [2022-01-11 06:05:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:53,723 INFO L470 AbstractCegarLoop]: Abstraction has 3828 states and 4041 transitions. [2022-01-11 06:05:53,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 4041 transitions. [2022-01-11 06:05:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-01-11 06:05:53,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:53,728 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:53,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 06:05:53,728 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash 738008431, now seen corresponding path program 1 times [2022-01-11 06:05:53,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:53,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602516323] [2022-01-11 06:05:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:53,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-11 06:05:53,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:53,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602516323] [2022-01-11 06:05:53,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602516323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:53,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:53,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:53,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410409892] [2022-01-11 06:05:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:53,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:53,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:53,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:53,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:53,816 INFO L87 Difference]: Start difference. First operand 3828 states and 4041 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:54,425 INFO L93 Difference]: Finished difference Result 5988 states and 6300 transitions. [2022-01-11 06:05:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:54,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 242 [2022-01-11 06:05:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:54,434 INFO L225 Difference]: With dead ends: 5988 [2022-01-11 06:05:54,434 INFO L226 Difference]: Without dead ends: 4900 [2022-01-11 06:05:54,436 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 06:05:54,437 INFO L933 BasicCegarLoop]: 637 mSDtfsCounter, 279 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 987 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 06:05:54,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 987 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2022-01-11 06:05:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 3830. [2022-01-11 06:05:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3830 states, 3829 states have (on average 1.0558892661269261) internal successors, (4043), 3829 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 4043 transitions. [2022-01-11 06:05:54,904 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 4043 transitions. Word has length 242 [2022-01-11 06:05:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:54,906 INFO L470 AbstractCegarLoop]: Abstraction has 3830 states and 4043 transitions. [2022-01-11 06:05:54,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 4043 transitions. [2022-01-11 06:05:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-11 06:05:54,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:54,912 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:54,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 06:05:54,912 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:54,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1373385192, now seen corresponding path program 1 times [2022-01-11 06:05:54,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:54,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981406496] [2022-01-11 06:05:54,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:54,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:05:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-11 06:05:54,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:05:54,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981406496] [2022-01-11 06:05:54,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981406496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:05:54,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:05:54,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:05:54,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014219101] [2022-01-11 06:05:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:05:54,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:05:54,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:05:54,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:05:54,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:05:54,994 INFO L87 Difference]: Start difference. First operand 3830 states and 4043 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:05:55,581 INFO L93 Difference]: Finished difference Result 5994 states and 6308 transitions. [2022-01-11 06:05:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:05:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 243 [2022-01-11 06:05:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:05:55,588 INFO L225 Difference]: With dead ends: 5994 [2022-01-11 06:05:55,588 INFO L226 Difference]: Without dead ends: 4904 [2022-01-11 06:05:55,589 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 06:05:55,590 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 279 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:05:55,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 988 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:05:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2022-01-11 06:05:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 3834. [2022-01-11 06:05:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3834 states, 3833 states have (on average 1.0558309418210279) internal successors, (4047), 3833 states have internal predecessors, (4047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 4047 transitions. [2022-01-11 06:05:55,911 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 4047 transitions. Word has length 243 [2022-01-11 06:05:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:05:55,912 INFO L470 AbstractCegarLoop]: Abstraction has 3834 states and 4047 transitions. [2022-01-11 06:05:55,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:05:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 4047 transitions. [2022-01-11 06:05:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-11 06:05:55,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:05:55,917 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:05:55,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 06:05:55,917 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:05:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:05:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1372461671, now seen corresponding path program 1 times [2022-01-11 06:05:55,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:05:55,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097227459] [2022-01-11 06:05:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:05:55,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:05:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 06:05:55,962 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 06:05:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 06:05:56,095 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 06:05:56,096 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 06:05:56,097 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-11 06:05:56,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-11 06:05:56,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 06:05:56,104 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-11 06:05:56,109 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 06:05:56,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:05:56 BasicIcfg [2022-01-11 06:05:56,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 06:05:56,645 INFO L158 Benchmark]: Toolchain (without parser) took 56617.09ms. Allocated memory was 218.1MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 159.7MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-01-11 06:05:56,646 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 218.1MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 06:05:56,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.00ms. Allocated memory was 218.1MB in the beginning and 318.8MB in the end (delta: 100.7MB). Free memory was 159.5MB in the beginning and 285.7MB in the end (delta: -126.2MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-01-11 06:05:56,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.02ms. Allocated memory is still 318.8MB. Free memory was 285.7MB in the beginning and 282.0MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 06:05:56,656 INFO L158 Benchmark]: Boogie Preprocessor took 68.49ms. Allocated memory is still 318.8MB. Free memory was 282.0MB in the beginning and 278.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 06:05:56,656 INFO L158 Benchmark]: RCFGBuilder took 821.65ms. Allocated memory is still 318.8MB. Free memory was 278.9MB in the beginning and 244.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-01-11 06:05:56,656 INFO L158 Benchmark]: IcfgTransformer took 195.22ms. Allocated memory is still 318.8MB. Free memory was 244.3MB in the beginning and 228.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-11 06:05:56,656 INFO L158 Benchmark]: TraceAbstraction took 55067.27ms. Allocated memory was 318.8MB in the beginning and 7.3GB in the end (delta: 7.0GB). Free memory was 228.0MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-01-11 06:05:56,657 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.12ms. Allocated memory is still 218.1MB. Free memory is still 176.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.00ms. Allocated memory was 218.1MB in the beginning and 318.8MB in the end (delta: 100.7MB). Free memory was 159.5MB in the beginning and 285.7MB in the end (delta: -126.2MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.02ms. Allocated memory is still 318.8MB. Free memory was 285.7MB in the beginning and 282.0MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.49ms. Allocated memory is still 318.8MB. Free memory was 282.0MB in the beginning and 278.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 821.65ms. Allocated memory is still 318.8MB. Free memory was 278.9MB in the beginning and 244.3MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * IcfgTransformer took 195.22ms. Allocated memory is still 318.8MB. Free memory was 244.3MB in the beginning and 228.5MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 55067.27ms. Allocated memory was 318.8MB in the beginning and 7.3GB in the end (delta: 7.0GB). Free memory was 228.0MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 3.6GB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int t3_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int t3_st ; [L32] int m_i ; [L33] int t1_i ; [L34] int t2_i ; [L35] int t3_i ; [L36] int M_E = 2; [L37] int T1_E = 2; [L38] int T2_E = 2; [L39] int T3_E = 2; [L40] int E_M = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L49] int token ; [L51] int local ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L735] int __retres1 ; [L739] CALL init_model() [L648] m_i = 1 [L649] t1_i = 1 [L650] t2_i = 1 [L651] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L739] RET init_model() [L740] CALL start_simulation() [L676] int kernel_st ; [L677] int tmp ; [L678] int tmp___0 ; [L682] kernel_st = 0 [L683] FCALL update_channels() [L684] CALL init_threads() [L304] COND TRUE m_i == 1 [L305] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L309] COND TRUE t1_i == 1 [L310] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L314] COND TRUE t2_i == 1 [L315] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L319] COND TRUE t3_i == 1 [L320] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] RET init_threads() [L685] CALL fire_delta_events() [L441] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L446] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L451] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L456] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L461] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L466] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L471] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L476] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L685] RET fire_delta_events() [L686] CALL activate_threads() [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L230] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L232] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L249] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L251] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L268] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L270] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L287] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L289] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L686] RET activate_threads() [L687] CALL reset_delta_events() [L489] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L494] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L499] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L504] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L509] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L514] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L519] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L524] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L687] RET reset_delta_events() [L690] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L693] kernel_st = 1 [L694] CALL eval() [L360] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] CALL, EXPR exists_runnable_thread() [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L355] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] RET, EXPR exists_runnable_thread() [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 [L394] CALL transmit1() [L112] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L123] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] RET transmit1() [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 [L408] CALL transmit2() [L148] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L159] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] RET transmit2() [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 [L422] CALL transmit3() [L184] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L195] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L422] RET transmit3() [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=4, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L367] CALL, EXPR exists_runnable_thread() [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L355] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L367] RET, EXPR exists_runnable_thread() [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=4, tmp_ndt_3=1, tmp_ndt_4=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L380] CALL master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L67] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L70] token = __VERIFIER_nondet_int() [L71] local = token [L72] E_1 = 1 [L73] CALL immediate_notify() [L581] CALL activate_threads() [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L220] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L230] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L239] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L240] COND TRUE E_1 == 1 [L241] __retres1 = 1 VAL [__retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] return (__retres1); VAL [\result=-1, __retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND TRUE \read(tmp___0) [L552] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L258] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L259] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L268] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L277] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L278] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L287] __retres1 = 0 VAL [__retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L289] return (__retres1); VAL [\result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L581] RET activate_threads() [L73] RET immediate_notify() [L74] E_1 = 2 [L75] m_pc = 1 [L76] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L380] RET master() [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 [L394] CALL transmit1() [L112] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L115] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L131] token += 1 [L132] E_2 = 1 [L133] CALL immediate_notify() [L581] CALL activate_threads() [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L221] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L230] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L249] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L259] COND TRUE E_2 == 1 [L260] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND TRUE \read(tmp___1) [L560] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L278] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L287] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L289] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L581] RET activate_threads() [L133] RET immediate_notify() [L134] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L123] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] RET transmit1() [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 [L408] CALL transmit2() [L148] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L151] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L167] token += 1 [L168] E_3 = 1 [L169] CALL immediate_notify() [L581] CALL activate_threads() [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L221] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L230] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L249] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L259] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L268] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L278] COND TRUE E_3 == 1 [L279] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L289] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND TRUE \read(tmp___2) [L568] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L581] RET activate_threads() [L169] RET immediate_notify() [L170] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L159] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] RET transmit2() [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 [L422] CALL transmit3() [L184] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L187] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L203] token += 1 [L204] E_M = 1 [L205] CALL immediate_notify() [L581] CALL activate_threads() [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L220] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L221] COND TRUE E_M == 1 [L222] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND TRUE \read(tmp) [L544] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L239] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L240] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L249] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L258] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L259] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L268] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L277] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L278] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L287] __retres1 = 0 VAL [__retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L289] return (__retres1); VAL [\result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L581] RET activate_threads() [L205] RET immediate_notify() [L206] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L195] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L422] RET transmit3() [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=5, tmp_ndt_3=1, tmp_ndt_4=1, token=3] [L367] CALL, EXPR exists_runnable_thread() [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L355] return (__retres1); VAL [\result=-1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L367] RET, EXPR exists_runnable_thread() [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=5, tmp_ndt_3=1, tmp_ndt_4=1, token=3] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L380] CALL master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L59] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L81] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L92] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L93] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L94] COND TRUE tmp_var == 5 [L95] CALL error() [L20] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 20]: 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, 333 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 54.5s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14640 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14640 mSDsluCounter, 29731 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12041 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 645 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 17690 mSDtfsCounter, 645 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41281occurred in iteration=20, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.9s AutomataMinimizationTime, 34 MinimizatonAttempts, 14084 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4442 NumberOfCodeBlocks, 4442 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4165 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 591/591 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 06:05:56,702 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...