/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/Problem05_label45+token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 13:39:47,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 13:39:47,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 13:39:47,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 13:39:47,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 13:39:47,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 13:39:47,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 13:39:47,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 13:39:47,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 13:39:47,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 13:39:47,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 13:39:47,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 13:39:47,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 13:39:47,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 13:39:47,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 13:39:47,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 13:39:47,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 13:39:47,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 13:39:47,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 13:39:47,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 13:39:47,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 13:39:47,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 13:39:47,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 13:39:47,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 13:39:47,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 13:39:47,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 13:39:47,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 13:39:47,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 13:39:47,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 13:39:47,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 13:39:47,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 13:39:47,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 13:39:47,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 13:39:47,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 13:39:47,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 13:39:47,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 13:39:47,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 13:39:47,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 13:39:47,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 13:39:47,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 13:39:47,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 13:39:47,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 13:39:47,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 13:39:47,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 13:39:47,888 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 13:39:47,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 13:39:47,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 13:39:47,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 13:39:47,889 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 13:39:47,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 13:39:47,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 13:39:47,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 13:39:47,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:39:47,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 13:39:47,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 13:39:47,892 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 13:39:47,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 13:39:47,892 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 13:39:47,892 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 13:39:48,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 13:39:48,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 13:39:48,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 13:39:48,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 13:39:48,117 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 13:39:48,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label45+token_ring.03.cil-1.c [2022-01-10 13:39:48,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c9b19fa/7e79283324b74ee7a8f8840b2fbe1c73/FLAGd55437f2c [2022-01-10 13:39:48,887 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 13:39:48,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label45+token_ring.03.cil-1.c [2022-01-10 13:39:48,922 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c9b19fa/7e79283324b74ee7a8f8840b2fbe1c73/FLAGd55437f2c [2022-01-10 13:39:49,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c9b19fa/7e79283324b74ee7a8f8840b2fbe1c73 [2022-01-10 13:39:49,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 13:39:49,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 13:39:49,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 13:39:49,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 13:39:49,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 13:39:49,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:39:49" (1/1) ... [2022-01-10 13:39:49,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f4cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:49, skipping insertion in model container [2022-01-10 13:39:49,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:39:49" (1/1) ... [2022-01-10 13:39:49,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 13:39:49,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 13:39:50,617 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2022-01-10 13:39:50,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2022-01-10 13:39:50,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:39:50,752 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 13:39:51,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2022-01-10 13:39:51,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2022-01-10 13:39:51,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:39:51,460 INFO L208 MainTranslator]: Completed translation [2022-01-10 13:39:51,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51 WrapperNode [2022-01-10 13:39:51,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 13:39:51,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 13:39:51,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 13:39:51,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 13:39:51,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:51,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:51,893 INFO L137 Inliner]: procedures = 51, calls = 51, calls flagged for inlining = 46, calls inlined = 73, statements flattened = 13160 [2022-01-10 13:39:51,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 13:39:51,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 13:39:51,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 13:39:51,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 13:39:51,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:51,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:51,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:51,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:52,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:52,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:52,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:52,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 13:39:52,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 13:39:52,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 13:39:52,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 13:39:52,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (1/1) ... [2022-01-10 13:39:52,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:39:52,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 13:39:52,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 13:39:52,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 13:39:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 13:39:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 13:39:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 13:39:52,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 13:39:52,482 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 13:39:52,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 13:39:58,978 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 13:39:58,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 13:39:58,996 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-10 13:39:58,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:39:58 BoogieIcfgContainer [2022-01-10 13:39:58,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 13:39:58,999 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 13:39:58,999 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 13:39:59,000 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 13:39:59,002 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:39:58" (1/1) ... [2022-01-10 13:40:00,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:40:00 BasicIcfg [2022-01-10 13:40:00,087 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 13:40:00,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 13:40:00,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 13:40:00,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 13:40:00,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:39:49" (1/4) ... [2022-01-10 13:40:00,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ad2691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:40:00, skipping insertion in model container [2022-01-10 13:40:00,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:39:51" (2/4) ... [2022-01-10 13:40:00,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ad2691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:40:00, skipping insertion in model container [2022-01-10 13:40:00,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:39:58" (3/4) ... [2022-01-10 13:40:00,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ad2691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:40:00, skipping insertion in model container [2022-01-10 13:40:00,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:40:00" (4/4) ... [2022-01-10 13:40:00,092 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-1.cTransformedIcfg [2022-01-10 13:40:00,095 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 13:40:00,095 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 13:40:00,126 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 13:40:00,130 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 13:40:00,130 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 13:40:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 2516 states, 2512 states have (on average 1.8288216560509554) internal successors, (4594), 2515 states have internal predecessors, (4594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:00,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:00,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:00,164 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash -202657724, now seen corresponding path program 1 times [2022-01-10 13:40:00,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:00,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895584128] [2022-01-10 13:40:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:00,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:00,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:00,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895584128] [2022-01-10 13:40:00,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895584128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:00,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:00,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:00,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454419880] [2022-01-10 13:40:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:00,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:00,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:00,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:00,340 INFO L87 Difference]: Start difference. First operand has 2516 states, 2512 states have (on average 1.8288216560509554) internal successors, (4594), 2515 states have internal predecessors, (4594), 0 states have call successors, (0), 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 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:00,560 INFO L93 Difference]: Finished difference Result 5266 states and 9548 transitions. [2022-01-10 13:40:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:00,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:00,585 INFO L225 Difference]: With dead ends: 5266 [2022-01-10 13:40:00,585 INFO L226 Difference]: Without dead ends: 2690 [2022-01-10 13:40:00,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:00,594 INFO L933 BasicCegarLoop]: 4509 mSDtfsCounter, 4457 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4457 SdHoareTripleChecker+Valid, 4910 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:00,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4457 Valid, 4910 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2022-01-10 13:40:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2686. [2022-01-10 13:40:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.7897875512486023) internal successors, (4802), 2685 states have internal predecessors, (4802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4802 transitions. [2022-01-10 13:40:00,700 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4802 transitions. Word has length 66 [2022-01-10 13:40:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:00,701 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4802 transitions. [2022-01-10 13:40:00,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4802 transitions. [2022-01-10 13:40:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:00,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:00,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:00,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 13:40:00,703 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1062444132, now seen corresponding path program 1 times [2022-01-10 13:40:00,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:00,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714624219] [2022-01-10 13:40:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:00,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:00,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:00,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714624219] [2022-01-10 13:40:00,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714624219] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:00,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:00,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:00,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614389704] [2022-01-10 13:40:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:00,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:00,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:00,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:00,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:00,757 INFO L87 Difference]: Start difference. First operand 2686 states and 4802 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:00,837 INFO L93 Difference]: Finished difference Result 3240 states and 5630 transitions. [2022-01-10 13:40:00,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:00,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:00,846 INFO L225 Difference]: With dead ends: 3240 [2022-01-10 13:40:00,846 INFO L226 Difference]: Without dead ends: 2686 [2022-01-10 13:40:00,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:00,849 INFO L933 BasicCegarLoop]: 4436 mSDtfsCounter, 4430 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:00,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4430 Valid, 4436 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-01-10 13:40:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2022-01-10 13:40:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.7868058143868804) internal successors, (4794), 2685 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4794 transitions. [2022-01-10 13:40:00,903 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4794 transitions. Word has length 66 [2022-01-10 13:40:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:00,903 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4794 transitions. [2022-01-10 13:40:00,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4794 transitions. [2022-01-10 13:40:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:00,912 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:00,913 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:00,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 13:40:00,916 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash -282219452, now seen corresponding path program 1 times [2022-01-10 13:40:00,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283481387] [2022-01-10 13:40:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:00,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:00,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:00,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283481387] [2022-01-10 13:40:00,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283481387] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:00,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:00,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:00,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872959757] [2022-01-10 13:40:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:00,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:00,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:00,974 INFO L87 Difference]: Start difference. First operand 2686 states and 4794 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:01,027 INFO L93 Difference]: Finished difference Result 3239 states and 5613 transitions. [2022-01-10 13:40:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:01,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:01,036 INFO L225 Difference]: With dead ends: 3239 [2022-01-10 13:40:01,037 INFO L226 Difference]: Without dead ends: 2686 [2022-01-10 13:40:01,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,044 INFO L933 BasicCegarLoop]: 4431 mSDtfsCounter, 4424 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4424 SdHoareTripleChecker+Valid, 4431 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:01,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4424 Valid, 4431 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-01-10 13:40:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2022-01-10 13:40:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.7838240775251584) internal successors, (4786), 2685 states have internal predecessors, (4786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4786 transitions. [2022-01-10 13:40:01,098 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4786 transitions. Word has length 66 [2022-01-10 13:40:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:01,098 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4786 transitions. [2022-01-10 13:40:01,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4786 transitions. [2022-01-10 13:40:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:01,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:01,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:01,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 13:40:01,101 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 367140964, now seen corresponding path program 1 times [2022-01-10 13:40:01,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:01,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464243472] [2022-01-10 13:40:01,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:01,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:01,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:01,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464243472] [2022-01-10 13:40:01,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464243472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:01,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:01,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:01,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16438089] [2022-01-10 13:40:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:01,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:01,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:01,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,186 INFO L87 Difference]: Start difference. First operand 2686 states and 4786 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:01,272 INFO L93 Difference]: Finished difference Result 3238 states and 5596 transitions. [2022-01-10 13:40:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:01,280 INFO L225 Difference]: With dead ends: 3238 [2022-01-10 13:40:01,280 INFO L226 Difference]: Without dead ends: 2686 [2022-01-10 13:40:01,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,288 INFO L933 BasicCegarLoop]: 4426 mSDtfsCounter, 4418 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4418 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:01,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4418 Valid, 4426 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-01-10 13:40:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2022-01-10 13:40:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.7808423406634364) internal successors, (4778), 2685 states have internal predecessors, (4778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4778 transitions. [2022-01-10 13:40:01,336 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4778 transitions. Word has length 66 [2022-01-10 13:40:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:01,337 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4778 transitions. [2022-01-10 13:40:01,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4778 transitions. [2022-01-10 13:40:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:01,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:01,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:01,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 13:40:01,338 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1967216572, now seen corresponding path program 1 times [2022-01-10 13:40:01,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:01,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457793403] [2022-01-10 13:40:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:01,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:01,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:01,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457793403] [2022-01-10 13:40:01,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457793403] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:01,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:01,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:01,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136997218] [2022-01-10 13:40:01,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:01,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:01,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:01,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:01,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,399 INFO L87 Difference]: Start difference. First operand 2686 states and 4778 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:01,460 INFO L93 Difference]: Finished difference Result 3237 states and 5579 transitions. [2022-01-10 13:40:01,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:01,467 INFO L225 Difference]: With dead ends: 3237 [2022-01-10 13:40:01,467 INFO L226 Difference]: Without dead ends: 2686 [2022-01-10 13:40:01,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,469 INFO L933 BasicCegarLoop]: 4409 mSDtfsCounter, 4364 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4364 SdHoareTripleChecker+Valid, 4447 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-10 13:40:01,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4364 Valid, 4447 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-01-10 13:40:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2022-01-10 13:40:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.7741334327245621) internal successors, (4760), 2685 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4760 transitions. [2022-01-10 13:40:01,518 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4760 transitions. Word has length 66 [2022-01-10 13:40:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:01,521 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4760 transitions. [2022-01-10 13:40:01,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4760 transitions. [2022-01-10 13:40:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:01,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:01,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:01,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 13:40:01,523 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1856693731, now seen corresponding path program 1 times [2022-01-10 13:40:01,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:01,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312689787] [2022-01-10 13:40:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:01,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:01,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:01,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312689787] [2022-01-10 13:40:01,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312689787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:01,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:01,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:01,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682327712] [2022-01-10 13:40:01,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:01,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:01,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:01,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:01,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,580 INFO L87 Difference]: Start difference. First operand 2686 states and 4760 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:01,638 INFO L93 Difference]: Finished difference Result 3236 states and 5542 transitions. [2022-01-10 13:40:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:01,646 INFO L225 Difference]: With dead ends: 3236 [2022-01-10 13:40:01,646 INFO L226 Difference]: Without dead ends: 2686 [2022-01-10 13:40:01,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,648 INFO L933 BasicCegarLoop]: 4398 mSDtfsCounter, 4353 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4353 SdHoareTripleChecker+Valid, 4435 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-10 13:40:01,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4353 Valid, 4435 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-01-10 13:40:01,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2022-01-10 13:40:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.7674245247856877) internal successors, (4742), 2685 states have internal predecessors, (4742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4742 transitions. [2022-01-10 13:40:01,692 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4742 transitions. Word has length 66 [2022-01-10 13:40:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:01,693 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4742 transitions. [2022-01-10 13:40:01,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4742 transitions. [2022-01-10 13:40:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:01,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:01,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:01,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 13:40:01,694 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1314655614, now seen corresponding path program 1 times [2022-01-10 13:40:01,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:01,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246792666] [2022-01-10 13:40:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:01,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:01,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:01,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246792666] [2022-01-10 13:40:01,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246792666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:01,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:01,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:01,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338666188] [2022-01-10 13:40:01,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:01,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:01,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,726 INFO L87 Difference]: Start difference. First operand 2686 states and 4742 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:01,921 INFO L93 Difference]: Finished difference Result 3235 states and 5505 transitions. [2022-01-10 13:40:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:01,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:01,929 INFO L225 Difference]: With dead ends: 3235 [2022-01-10 13:40:01,929 INFO L226 Difference]: Without dead ends: 2686 [2022-01-10 13:40:01,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:01,931 INFO L933 BasicCegarLoop]: 4387 mSDtfsCounter, 4342 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4342 SdHoareTripleChecker+Valid, 4423 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-10 13:40:01,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4342 Valid, 4423 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-01-10 13:40:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2022-01-10 13:40:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.7607156168468132) internal successors, (4724), 2685 states have internal predecessors, (4724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4724 transitions. [2022-01-10 13:40:01,985 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4724 transitions. Word has length 66 [2022-01-10 13:40:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:01,985 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4724 transitions. [2022-01-10 13:40:01,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4724 transitions. [2022-01-10 13:40:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:01,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:01,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:01,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 13:40:01,990 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash -720388447, now seen corresponding path program 1 times [2022-01-10 13:40:01,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:01,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612366594] [2022-01-10 13:40:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:01,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:02,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:02,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612366594] [2022-01-10 13:40:02,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612366594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:02,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:02,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:02,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603223635] [2022-01-10 13:40:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:02,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:02,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:02,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:02,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,022 INFO L87 Difference]: Start difference. First operand 2686 states and 4724 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:02,074 INFO L93 Difference]: Finished difference Result 3234 states and 5468 transitions. [2022-01-10 13:40:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:02,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:02,081 INFO L225 Difference]: With dead ends: 3234 [2022-01-10 13:40:02,081 INFO L226 Difference]: Without dead ends: 2686 [2022-01-10 13:40:02,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,082 INFO L933 BasicCegarLoop]: 4376 mSDtfsCounter, 4331 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4331 SdHoareTripleChecker+Valid, 4411 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-10 13:40:02,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4331 Valid, 4411 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2022-01-10 13:40:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2686. [2022-01-10 13:40:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2683 states have (on average 1.754006708907939) internal successors, (4706), 2685 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 4706 transitions. [2022-01-10 13:40:02,122 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 4706 transitions. Word has length 66 [2022-01-10 13:40:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:02,123 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 4706 transitions. [2022-01-10 13:40:02,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 4706 transitions. [2022-01-10 13:40:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:40:02,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:02,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:02,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 13:40:02,124 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1238681983, now seen corresponding path program 1 times [2022-01-10 13:40:02,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:02,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111210761] [2022-01-10 13:40:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:02,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:02,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111210761] [2022-01-10 13:40:02,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111210761] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:02,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:02,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:02,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613667878] [2022-01-10 13:40:02,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:02,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:02,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,162 INFO L87 Difference]: Start difference. First operand 2686 states and 4706 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:02,228 INFO L93 Difference]: Finished difference Result 3710 states and 6065 transitions. [2022-01-10 13:40:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-10 13:40:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:02,246 INFO L225 Difference]: With dead ends: 3710 [2022-01-10 13:40:02,246 INFO L226 Difference]: Without dead ends: 3164 [2022-01-10 13:40:02,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,249 INFO L933 BasicCegarLoop]: 4377 mSDtfsCounter, 4291 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4291 SdHoareTripleChecker+Valid, 4722 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-10 13:40:02,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4291 Valid, 4722 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2022-01-10 13:40:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3110. [2022-01-10 13:40:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 3107 states have (on average 1.6919858384293531) internal successors, (5257), 3109 states have internal predecessors, (5257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 5257 transitions. [2022-01-10 13:40:02,303 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 5257 transitions. Word has length 66 [2022-01-10 13:40:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:02,303 INFO L470 AbstractCegarLoop]: Abstraction has 3110 states and 5257 transitions. [2022-01-10 13:40:02,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 5257 transitions. [2022-01-10 13:40:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 13:40:02,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:02,307 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-10 13:40:02,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 13:40:02,307 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash 945473165, now seen corresponding path program 1 times [2022-01-10 13:40:02,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:02,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448044265] [2022-01-10 13:40:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:02,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:02,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:02,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448044265] [2022-01-10 13:40:02,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448044265] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:02,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:02,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:02,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121719772] [2022-01-10 13:40:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:02,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:02,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,350 INFO L87 Difference]: Start difference. First operand 3110 states and 5257 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:02,440 INFO L93 Difference]: Finished difference Result 4950 states and 7688 transitions. [2022-01-10 13:40:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-10 13:40:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:02,447 INFO L225 Difference]: With dead ends: 4950 [2022-01-10 13:40:02,447 INFO L226 Difference]: Without dead ends: 3986 [2022-01-10 13:40:02,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,449 INFO L933 BasicCegarLoop]: 4374 mSDtfsCounter, 4309 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4309 SdHoareTripleChecker+Valid, 4719 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-10 13:40:02,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4309 Valid, 4719 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2022-01-10 13:40:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3894. [2022-01-10 13:40:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3894 states, 3891 states have (on average 1.61526599845798) internal successors, (6285), 3893 states have internal predecessors, (6285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3894 states to 3894 states and 6285 transitions. [2022-01-10 13:40:02,529 INFO L78 Accepts]: Start accepts. Automaton has 3894 states and 6285 transitions. Word has length 106 [2022-01-10 13:40:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:02,529 INFO L470 AbstractCegarLoop]: Abstraction has 3894 states and 6285 transitions. [2022-01-10 13:40:02,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3894 states and 6285 transitions. [2022-01-10 13:40:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 13:40:02,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:02,530 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-10 13:40:02,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 13:40:02,531 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:02,531 INFO L85 PathProgramCache]: Analyzing trace with hash 426970764, now seen corresponding path program 1 times [2022-01-10 13:40:02,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:02,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798306586] [2022-01-10 13:40:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:02,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:02,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:02,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798306586] [2022-01-10 13:40:02,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798306586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:02,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:02,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:02,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201120363] [2022-01-10 13:40:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:02,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:02,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:02,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:02,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,574 INFO L87 Difference]: Start difference. First operand 3894 states and 6285 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:02,689 INFO L93 Difference]: Finished difference Result 7251 states and 10656 transitions. [2022-01-10 13:40:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-10 13:40:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:02,697 INFO L225 Difference]: With dead ends: 7251 [2022-01-10 13:40:02,697 INFO L226 Difference]: Without dead ends: 5531 [2022-01-10 13:40:02,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,700 INFO L933 BasicCegarLoop]: 4466 mSDtfsCounter, 4318 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 4865 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-10 13:40:02,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4318 Valid, 4865 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5531 states. [2022-01-10 13:40:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5531 to 5455. [2022-01-10 13:40:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5455 states, 5452 states have (on average 1.516140865737344) internal successors, (8266), 5454 states have internal predecessors, (8266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 8266 transitions. [2022-01-10 13:40:02,958 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 8266 transitions. Word has length 106 [2022-01-10 13:40:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:02,958 INFO L470 AbstractCegarLoop]: Abstraction has 5455 states and 8266 transitions. [2022-01-10 13:40:02,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 8266 transitions. [2022-01-10 13:40:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 13:40:02,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:02,960 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-10 13:40:02,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 13:40:02,960 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -420964564, now seen corresponding path program 1 times [2022-01-10 13:40:02,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:02,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109520925] [2022-01-10 13:40:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:02,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 13:40:02,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:02,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109520925] [2022-01-10 13:40:02,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109520925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:02,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:02,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:02,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614712216] [2022-01-10 13:40:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:02,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:02,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:02,990 INFO L87 Difference]: Start difference. First operand 5455 states and 8266 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-10 13:40:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:03,081 INFO L93 Difference]: Finished difference Result 8713 states and 12484 transitions. [2022-01-10 13:40:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:03,081 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-10 13:40:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:03,088 INFO L225 Difference]: With dead ends: 8713 [2022-01-10 13:40:03,089 INFO L226 Difference]: Without dead ends: 5408 [2022-01-10 13:40:03,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:03,093 INFO L933 BasicCegarLoop]: 4381 mSDtfsCounter, 419 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 8339 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:03,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 8339 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5408 states. [2022-01-10 13:40:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5408 to 5408. [2022-01-10 13:40:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5408 states, 5405 states have (on average 1.518963922294172) internal successors, (8210), 5407 states have internal predecessors, (8210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:03,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5408 states to 5408 states and 8210 transitions. [2022-01-10 13:40:03,198 INFO L78 Accepts]: Start accepts. Automaton has 5408 states and 8210 transitions. Word has length 106 [2022-01-10 13:40:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:03,198 INFO L470 AbstractCegarLoop]: Abstraction has 5408 states and 8210 transitions. [2022-01-10 13:40:03,198 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-10 13:40:03,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5408 states and 8210 transitions. [2022-01-10 13:40:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 13:40:03,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:03,200 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-10 13:40:03,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 13:40:03,200 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:03,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1577245362, now seen corresponding path program 1 times [2022-01-10 13:40:03,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:03,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381968400] [2022-01-10 13:40:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:03,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:03,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:03,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381968400] [2022-01-10 13:40:03,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381968400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:03,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:03,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:03,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828689847] [2022-01-10 13:40:03,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:03,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:03,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:03,230 INFO L87 Difference]: Start difference. First operand 5408 states and 8210 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:03,386 INFO L93 Difference]: Finished difference Result 11514 states and 16083 transitions. [2022-01-10 13:40:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:03,386 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-10 13:40:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:03,399 INFO L225 Difference]: With dead ends: 11514 [2022-01-10 13:40:03,399 INFO L226 Difference]: Without dead ends: 8280 [2022-01-10 13:40:03,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:03,405 INFO L933 BasicCegarLoop]: 4477 mSDtfsCounter, 4317 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 4874 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-10 13:40:03,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4317 Valid, 4874 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2022-01-10 13:40:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8100. [2022-01-10 13:40:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8100 states, 8097 states have (on average 1.4359639372607138) internal successors, (11627), 8099 states have internal predecessors, (11627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 11627 transitions. [2022-01-10 13:40:03,657 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 11627 transitions. Word has length 107 [2022-01-10 13:40:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:03,657 INFO L470 AbstractCegarLoop]: Abstraction has 8100 states and 11627 transitions. [2022-01-10 13:40:03,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 11627 transitions. [2022-01-10 13:40:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 13:40:03,660 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:03,660 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-10 13:40:03,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 13:40:03,660 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -559026773, now seen corresponding path program 1 times [2022-01-10 13:40:03,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:03,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880752388] [2022-01-10 13:40:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:03,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 13:40:03,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:03,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880752388] [2022-01-10 13:40:03,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880752388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:03,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:03,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:03,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920124897] [2022-01-10 13:40:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:03,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:03,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:03,683 INFO L87 Difference]: Start difference. First operand 8100 states and 11627 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-10 13:40:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:03,886 INFO L93 Difference]: Finished difference Result 13997 states and 19200 transitions. [2022-01-10 13:40:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:03,887 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-10 13:40:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:03,899 INFO L225 Difference]: With dead ends: 13997 [2022-01-10 13:40:03,899 INFO L226 Difference]: Without dead ends: 8054 [2022-01-10 13:40:03,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:03,908 INFO L933 BasicCegarLoop]: 4380 mSDtfsCounter, 417 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 8338 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:03,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 8338 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8054 states. [2022-01-10 13:40:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8054 to 8054. [2022-01-10 13:40:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8054 states, 8051 states have (on average 1.4374611849459695) internal successors, (11573), 8053 states have internal predecessors, (11573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8054 states to 8054 states and 11573 transitions. [2022-01-10 13:40:04,152 INFO L78 Accepts]: Start accepts. Automaton has 8054 states and 11573 transitions. Word has length 107 [2022-01-10 13:40:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:04,152 INFO L470 AbstractCegarLoop]: Abstraction has 8054 states and 11573 transitions. [2022-01-10 13:40:04,152 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-10 13:40:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 8054 states and 11573 transitions. [2022-01-10 13:40:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 13:40:04,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:04,155 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-10 13:40:04,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 13:40:04,155 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:04,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1069271650, now seen corresponding path program 1 times [2022-01-10 13:40:04,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:04,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143194039] [2022-01-10 13:40:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:04,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:04,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:04,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143194039] [2022-01-10 13:40:04,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143194039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:04,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:04,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:04,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72441757] [2022-01-10 13:40:04,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:04,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:04,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:04,192 INFO L87 Difference]: Start difference. First operand 8054 states and 11573 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-10 13:40:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:04,581 INFO L93 Difference]: Finished difference Result 18867 states and 25404 transitions. [2022-01-10 13:40:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:04,581 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-10 13:40:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:04,601 INFO L225 Difference]: With dead ends: 18867 [2022-01-10 13:40:04,601 INFO L226 Difference]: Without dead ends: 12987 [2022-01-10 13:40:04,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:04,612 INFO L933 BasicCegarLoop]: 4449 mSDtfsCounter, 4316 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 4844 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-10 13:40:04,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4316 Valid, 4844 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12987 states. [2022-01-10 13:40:04,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12987 to 12855. [2022-01-10 13:40:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12855 states, 12852 states have (on average 1.3744164332399627) internal successors, (17664), 12854 states have internal predecessors, (17664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 17664 transitions. [2022-01-10 13:40:04,988 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 17664 transitions. Word has length 108 [2022-01-10 13:40:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:04,988 INFO L470 AbstractCegarLoop]: Abstraction has 12855 states and 17664 transitions. [2022-01-10 13:40:04,988 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-10 13:40:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 17664 transitions. [2022-01-10 13:40:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 13:40:04,992 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:04,992 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:04,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 13:40:04,992 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1630234431, now seen corresponding path program 1 times [2022-01-10 13:40:04,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:04,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432050975] [2022-01-10 13:40:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:04,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 13:40:05,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:05,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432050975] [2022-01-10 13:40:05,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432050975] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:05,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:05,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:05,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907302249] [2022-01-10 13:40:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:05,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:05,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:05,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:05,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:05,012 INFO L87 Difference]: Start difference. First operand 12855 states and 17664 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:05,285 INFO L93 Difference]: Finished difference Result 23501 states and 31268 transitions. [2022-01-10 13:40:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:05,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-01-10 13:40:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:05,304 INFO L225 Difference]: With dead ends: 23501 [2022-01-10 13:40:05,304 INFO L226 Difference]: Without dead ends: 12810 [2022-01-10 13:40:05,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:05,315 INFO L933 BasicCegarLoop]: 4379 mSDtfsCounter, 415 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 8337 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:05,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 8337 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12810 states. [2022-01-10 13:40:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12810 to 12810. [2022-01-10 13:40:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12810 states, 12807 states have (on average 1.3751854454595143) internal successors, (17612), 12809 states have internal predecessors, (17612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12810 states to 12810 states and 17612 transitions. [2022-01-10 13:40:05,706 INFO L78 Accepts]: Start accepts. Automaton has 12810 states and 17612 transitions. Word has length 108 [2022-01-10 13:40:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:05,706 INFO L470 AbstractCegarLoop]: Abstraction has 12810 states and 17612 transitions. [2022-01-10 13:40:05,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 12810 states and 17612 transitions. [2022-01-10 13:40:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 13:40:05,710 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:05,710 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:05,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 13:40:05,710 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2102120895, now seen corresponding path program 1 times [2022-01-10 13:40:05,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:05,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853884639] [2022-01-10 13:40:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:05,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:05,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:05,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853884639] [2022-01-10 13:40:05,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853884639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:05,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:05,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:05,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770502343] [2022-01-10 13:40:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:05,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:05,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:05,740 INFO L87 Difference]: Start difference. First operand 12810 states and 17612 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:06,334 INFO L93 Difference]: Finished difference Result 32670 states and 42820 transitions. [2022-01-10 13:40:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:06,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-01-10 13:40:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:06,364 INFO L225 Difference]: With dead ends: 32670 [2022-01-10 13:40:06,364 INFO L226 Difference]: Without dead ends: 22034 [2022-01-10 13:40:06,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:06,379 INFO L933 BasicCegarLoop]: 4718 mSDtfsCounter, 337 mSDsluCounter, 4359 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 9077 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-10 13:40:06,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 9077 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22034 states. [2022-01-10 13:40:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22034 to 22034. [2022-01-10 13:40:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22034 states, 22031 states have (on average 1.3149652762017157) internal successors, (28970), 22033 states have internal predecessors, (28970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22034 states to 22034 states and 28970 transitions. [2022-01-10 13:40:06,991 INFO L78 Accepts]: Start accepts. Automaton has 22034 states and 28970 transitions. Word has length 109 [2022-01-10 13:40:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:06,991 INFO L470 AbstractCegarLoop]: Abstraction has 22034 states and 28970 transitions. [2022-01-10 13:40:06,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 22034 states and 28970 transitions. [2022-01-10 13:40:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-10 13:40:07,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:07,021 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:07,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 13:40:07,021 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:07,021 INFO L85 PathProgramCache]: Analyzing trace with hash -213855212, now seen corresponding path program 1 times [2022-01-10 13:40:07,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:07,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534916988] [2022-01-10 13:40:07,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:07,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:07,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:07,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534916988] [2022-01-10 13:40:07,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534916988] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:07,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:07,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:07,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574053650] [2022-01-10 13:40:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:07,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:07,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:07,082 INFO L87 Difference]: Start difference. First operand 22034 states and 28970 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:07,993 INFO L93 Difference]: Finished difference Result 50724 states and 64950 transitions. [2022-01-10 13:40:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:07,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-01-10 13:40:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:08,033 INFO L225 Difference]: With dead ends: 50724 [2022-01-10 13:40:08,033 INFO L226 Difference]: Without dead ends: 30868 [2022-01-10 13:40:08,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:08,053 INFO L933 BasicCegarLoop]: 4371 mSDtfsCounter, 4218 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4218 SdHoareTripleChecker+Valid, 4716 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-10 13:40:08,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4218 Valid, 4716 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30868 states. [2022-01-10 13:40:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30868 to 30736. [2022-01-10 13:40:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30736 states, 30733 states have (on average 1.2900139914749618) internal successors, (39646), 30735 states have internal predecessors, (39646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30736 states to 30736 states and 39646 transitions. [2022-01-10 13:40:09,041 INFO L78 Accepts]: Start accepts. Automaton has 30736 states and 39646 transitions. Word has length 140 [2022-01-10 13:40:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:09,042 INFO L470 AbstractCegarLoop]: Abstraction has 30736 states and 39646 transitions. [2022-01-10 13:40:09,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30736 states and 39646 transitions. [2022-01-10 13:40:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-10 13:40:09,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:09,057 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:09,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 13:40:09,057 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:09,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash 647066896, now seen corresponding path program 1 times [2022-01-10 13:40:09,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:09,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945014852] [2022-01-10 13:40:09,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:09,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:09,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:09,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945014852] [2022-01-10 13:40:09,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945014852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:09,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:09,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:40:09,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840817818] [2022-01-10 13:40:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:09,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:09,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:09,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:09,107 INFO L87 Difference]: Start difference. First operand 30736 states and 39646 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:10,531 INFO L93 Difference]: Finished difference Result 72036 states and 91140 transitions. [2022-01-10 13:40:10,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:10,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-01-10 13:40:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:10,595 INFO L225 Difference]: With dead ends: 72036 [2022-01-10 13:40:10,595 INFO L226 Difference]: Without dead ends: 43490 [2022-01-10 13:40:10,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:10,628 INFO L933 BasicCegarLoop]: 4369 mSDtfsCounter, 4220 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4220 SdHoareTripleChecker+Valid, 4714 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-10 13:40:10,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4220 Valid, 4714 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43490 states. [2022-01-10 13:40:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43490 to 43294. [2022-01-10 13:40:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43294 states, 43291 states have (on average 1.2707953154235292) internal successors, (55014), 43293 states have internal predecessors, (55014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43294 states to 43294 states and 55014 transitions. [2022-01-10 13:40:12,055 INFO L78 Accepts]: Start accepts. Automaton has 43294 states and 55014 transitions. Word has length 140 [2022-01-10 13:40:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:12,055 INFO L470 AbstractCegarLoop]: Abstraction has 43294 states and 55014 transitions. [2022-01-10 13:40:12,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43294 states and 55014 transitions. [2022-01-10 13:40:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-10 13:40:12,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:12,081 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:12,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 13:40:12,082 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:12,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:12,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2029344296, now seen corresponding path program 1 times [2022-01-10 13:40:12,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:12,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290782563] [2022-01-10 13:40:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:12,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:12,108 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-10 13:40:12,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:12,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290782563] [2022-01-10 13:40:12,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290782563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:12,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:12,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:12,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256686261] [2022-01-10 13:40:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:12,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:12,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:12,109 INFO L87 Difference]: Start difference. First operand 43294 states and 55014 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:13,416 INFO L93 Difference]: Finished difference Result 75848 states and 95600 transitions. [2022-01-10 13:40:13,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:13,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-10 13:40:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:13,471 INFO L225 Difference]: With dead ends: 75848 [2022-01-10 13:40:13,472 INFO L226 Difference]: Without dead ends: 44146 [2022-01-10 13:40:13,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:13,496 INFO L933 BasicCegarLoop]: 4381 mSDtfsCounter, 4278 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4278 SdHoareTripleChecker+Valid, 4775 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-10 13:40:13,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4278 Valid, 4775 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44146 states. [2022-01-10 13:40:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44146 to 42574. [2022-01-10 13:40:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42574 states, 42571 states have (on average 1.2545159850602523) internal successors, (53406), 42573 states have internal predecessors, (53406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 53406 transitions. [2022-01-10 13:40:15,063 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 53406 transitions. Word has length 157 [2022-01-10 13:40:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:15,063 INFO L470 AbstractCegarLoop]: Abstraction has 42574 states and 53406 transitions. [2022-01-10 13:40:15,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 53406 transitions. [2022-01-10 13:40:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 13:40:15,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:15,087 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:15,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 13:40:15,087 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:15,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1177354213, now seen corresponding path program 1 times [2022-01-10 13:40:15,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:15,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164144395] [2022-01-10 13:40:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:15,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:15,142 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-10 13:40:15,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:15,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164144395] [2022-01-10 13:40:15,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164144395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:15,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:15,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:15,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362882819] [2022-01-10 13:40:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:15,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:15,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:15,144 INFO L87 Difference]: Start difference. First operand 42574 states and 53406 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:16,630 INFO L93 Difference]: Finished difference Result 82934 states and 102750 transitions. [2022-01-10 13:40:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-10 13:40:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:16,685 INFO L225 Difference]: With dead ends: 82934 [2022-01-10 13:40:16,685 INFO L226 Difference]: Without dead ends: 42578 [2022-01-10 13:40:16,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:16,718 INFO L933 BasicCegarLoop]: 4657 mSDtfsCounter, 298 mSDsluCounter, 4344 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 9001 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.2s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:16,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 9001 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 13:40:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42578 states. [2022-01-10 13:40:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42578 to 42574. [2022-01-10 13:40:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42574 states, 42571 states have (on average 1.2460595240891688) internal successors, (53046), 42573 states have internal predecessors, (53046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 53046 transitions. [2022-01-10 13:40:18,524 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 53046 transitions. Word has length 158 [2022-01-10 13:40:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:18,524 INFO L470 AbstractCegarLoop]: Abstraction has 42574 states and 53046 transitions. [2022-01-10 13:40:18,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 53046 transitions. [2022-01-10 13:40:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 13:40:18,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:18,543 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:18,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 13:40:18,543 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2131487745, now seen corresponding path program 1 times [2022-01-10 13:40:18,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:18,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676218914] [2022-01-10 13:40:18,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:18,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:18,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676218914] [2022-01-10 13:40:18,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676218914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:18,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:18,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:18,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660970757] [2022-01-10 13:40:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:18,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:18,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:18,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:18,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:18,588 INFO L87 Difference]: Start difference. First operand 42574 states and 53046 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-10 13:40:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:19,966 INFO L93 Difference]: Finished difference Result 70638 states and 87354 transitions. [2022-01-10 13:40:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:19,966 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-10 13:40:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:20,017 INFO L225 Difference]: With dead ends: 70638 [2022-01-10 13:40:20,017 INFO L226 Difference]: Without dead ends: 42578 [2022-01-10 13:40:20,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:20,039 INFO L933 BasicCegarLoop]: 4666 mSDtfsCounter, 293 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 9016 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-10 13:40:20,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 9016 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42578 states. [2022-01-10 13:40:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42578 to 42574. [2022-01-10 13:40:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42574 states, 42571 states have (on average 1.2421131756359964) internal successors, (52878), 42573 states have internal predecessors, (52878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 52878 transitions. [2022-01-10 13:40:21,507 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 52878 transitions. Word has length 158 [2022-01-10 13:40:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:21,507 INFO L470 AbstractCegarLoop]: Abstraction has 42574 states and 52878 transitions. [2022-01-10 13:40:21,507 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-10 13:40:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 52878 transitions. [2022-01-10 13:40:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 13:40:21,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:21,527 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 13:40:21,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 13:40:21,528 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 737639735, now seen corresponding path program 1 times [2022-01-10 13:40:21,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:21,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847641227] [2022-01-10 13:40:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:21,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:40:21,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:21,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847641227] [2022-01-10 13:40:21,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847641227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:21,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:21,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:21,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820295444] [2022-01-10 13:40:21,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:21,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:21,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:21,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:21,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:21,563 INFO L87 Difference]: Start difference. First operand 42574 states and 52878 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-10 13:40:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:22,954 INFO L93 Difference]: Finished difference Result 70614 states and 87026 transitions. [2022-01-10 13:40:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:22,954 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-10 13:40:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:23,015 INFO L225 Difference]: With dead ends: 70614 [2022-01-10 13:40:23,016 INFO L226 Difference]: Without dead ends: 42578 [2022-01-10 13:40:23,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:23,044 INFO L933 BasicCegarLoop]: 4674 mSDtfsCounter, 293 mSDsluCounter, 4356 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 9030 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-10 13:40:23,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 9030 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42578 states. [2022-01-10 13:40:24,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42578 to 42574. [2022-01-10 13:40:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42574 states, 42571 states have (on average 1.2392943553123017) internal successors, (52758), 42573 states have internal predecessors, (52758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 52758 transitions. [2022-01-10 13:40:24,593 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 52758 transitions. Word has length 158 [2022-01-10 13:40:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:24,594 INFO L470 AbstractCegarLoop]: Abstraction has 42574 states and 52758 transitions. [2022-01-10 13:40:24,594 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-10 13:40:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 52758 transitions. [2022-01-10 13:40:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 13:40:24,610 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:24,610 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-10 13:40:24,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 13:40:24,610 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash -343394932, now seen corresponding path program 1 times [2022-01-10 13:40:24,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:24,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167390723] [2022-01-10 13:40:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:24,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:24,662 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-10 13:40:24,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:24,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167390723] [2022-01-10 13:40:24,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167390723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:24,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:24,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:24,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309437166] [2022-01-10 13:40:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:24,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:24,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:24,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:24,665 INFO L87 Difference]: Start difference. First operand 42574 states and 52758 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:26,122 INFO L93 Difference]: Finished difference Result 66258 states and 81816 transitions. [2022-01-10 13:40:26,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:26,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-10 13:40:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:26,185 INFO L225 Difference]: With dead ends: 66258 [2022-01-10 13:40:26,185 INFO L226 Difference]: Without dead ends: 44434 [2022-01-10 13:40:26,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:26,213 INFO L933 BasicCegarLoop]: 4577 mSDtfsCounter, 347 mSDsluCounter, 4335 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 8912 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:26,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 8912 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44434 states. [2022-01-10 13:40:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44434 to 42574. [2022-01-10 13:40:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42574 states, 42571 states have (on average 1.2260458997909376) internal successors, (52194), 42573 states have internal predecessors, (52194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 52194 transitions. [2022-01-10 13:40:27,851 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 52194 transitions. Word has length 158 [2022-01-10 13:40:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:27,851 INFO L470 AbstractCegarLoop]: Abstraction has 42574 states and 52194 transitions. [2022-01-10 13:40:27,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 52194 transitions. [2022-01-10 13:40:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 13:40:27,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:27,869 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-10 13:40:27,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 13:40:27,869 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:27,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1372551687, now seen corresponding path program 1 times [2022-01-10 13:40:27,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:27,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567477982] [2022-01-10 13:40:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:27,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:27,904 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-10 13:40:27,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:27,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567477982] [2022-01-10 13:40:27,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567477982] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:27,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:27,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:27,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337472552] [2022-01-10 13:40:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:27,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:27,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:27,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:27,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:27,905 INFO L87 Difference]: Start difference. First operand 42574 states and 52194 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-10 13:40:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:29,263 INFO L93 Difference]: Finished difference Result 70806 states and 86022 transitions. [2022-01-10 13:40:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:29,264 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-10 13:40:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:29,325 INFO L225 Difference]: With dead ends: 70806 [2022-01-10 13:40:29,325 INFO L226 Difference]: Without dead ends: 42770 [2022-01-10 13:40:29,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:29,353 INFO L933 BasicCegarLoop]: 4662 mSDtfsCounter, 322 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 8970 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-10 13:40:29,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 8970 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42770 states. [2022-01-10 13:40:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42770 to 42574. [2022-01-10 13:40:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42574 states, 42571 states have (on average 1.2087571351389443) internal successors, (51458), 42573 states have internal predecessors, (51458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 51458 transitions. [2022-01-10 13:40:31,075 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 51458 transitions. Word has length 158 [2022-01-10 13:40:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:31,075 INFO L470 AbstractCegarLoop]: Abstraction has 42574 states and 51458 transitions. [2022-01-10 13:40:31,075 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-10 13:40:31,076 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 51458 transitions. [2022-01-10 13:40:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 13:40:31,092 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:31,092 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-10 13:40:31,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 13:40:31,092 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:31,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1280133448, now seen corresponding path program 1 times [2022-01-10 13:40:31,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:31,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110706936] [2022-01-10 13:40:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:31,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:31,126 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-10 13:40:31,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:31,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110706936] [2022-01-10 13:40:31,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110706936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:31,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:31,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:31,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998888483] [2022-01-10 13:40:31,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:31,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:31,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:31,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:31,127 INFO L87 Difference]: Start difference. First operand 42574 states and 51458 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:32,238 INFO L93 Difference]: Finished difference Result 73686 states and 88146 transitions. [2022-01-10 13:40:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-10 13:40:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:32,282 INFO L225 Difference]: With dead ends: 73686 [2022-01-10 13:40:32,282 INFO L226 Difference]: Without dead ends: 33330 [2022-01-10 13:40:32,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:32,310 INFO L933 BasicCegarLoop]: 4648 mSDtfsCounter, 296 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 8942 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-10 13:40:32,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 8942 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33330 states. [2022-01-10 13:40:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33330 to 33182. [2022-01-10 13:40:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33182 states, 33179 states have (on average 1.2068477048735646) internal successors, (40042), 33181 states have internal predecessors, (40042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33182 states to 33182 states and 40042 transitions. [2022-01-10 13:40:33,574 INFO L78 Accepts]: Start accepts. Automaton has 33182 states and 40042 transitions. Word has length 159 [2022-01-10 13:40:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:33,587 INFO L470 AbstractCegarLoop]: Abstraction has 33182 states and 40042 transitions. [2022-01-10 13:40:33,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 33182 states and 40042 transitions. [2022-01-10 13:40:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 13:40:33,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:33,598 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-10 13:40:33,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 13:40:33,615 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -111634237, now seen corresponding path program 1 times [2022-01-10 13:40:33,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:33,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833993811] [2022-01-10 13:40:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:33,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:33,680 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-10 13:40:33,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:33,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833993811] [2022-01-10 13:40:33,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833993811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:33,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:33,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:33,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305285318] [2022-01-10 13:40:33,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:33,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:33,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:33,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:33,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:33,681 INFO L87 Difference]: Start difference. First operand 33182 states and 40042 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:34,818 INFO L93 Difference]: Finished difference Result 54842 states and 65334 transitions. [2022-01-10 13:40:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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-10 13:40:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:34,871 INFO L225 Difference]: With dead ends: 54842 [2022-01-10 13:40:34,871 INFO L226 Difference]: Without dead ends: 33330 [2022-01-10 13:40:34,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:34,895 INFO L933 BasicCegarLoop]: 4650 mSDtfsCounter, 323 mSDsluCounter, 4299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 8949 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-10 13:40:34,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 8949 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33330 states. [2022-01-10 13:40:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33330 to 33182. [2022-01-10 13:40:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33182 states, 33179 states have (on average 1.1898490008740468) internal successors, (39478), 33181 states have internal predecessors, (39478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33182 states to 33182 states and 39478 transitions. [2022-01-10 13:40:36,204 INFO L78 Accepts]: Start accepts. Automaton has 33182 states and 39478 transitions. Word has length 159 [2022-01-10 13:40:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:36,205 INFO L470 AbstractCegarLoop]: Abstraction has 33182 states and 39478 transitions. [2022-01-10 13:40:36,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 33182 states and 39478 transitions. [2022-01-10 13:40:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 13:40:36,217 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:36,217 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, 1] [2022-01-10 13:40:36,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 13:40:36,217 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1063421134, now seen corresponding path program 1 times [2022-01-10 13:40:36,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:36,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333414594] [2022-01-10 13:40:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:36,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:36,303 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-10 13:40:36,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:36,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333414594] [2022-01-10 13:40:36,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333414594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:36,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:36,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:40:36,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784246537] [2022-01-10 13:40:36,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:36,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:40:36,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:36,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:40:36,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:40:36,305 INFO L87 Difference]: Start difference. First operand 33182 states and 39478 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:37,870 INFO L93 Difference]: Finished difference Result 57993 states and 68011 transitions. [2022-01-10 13:40:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:40:37,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-10 13:40:37,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:37,908 INFO L225 Difference]: With dead ends: 57993 [2022-01-10 13:40:37,908 INFO L226 Difference]: Without dead ends: 26955 [2022-01-10 13:40:37,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 13:40:37,932 INFO L933 BasicCegarLoop]: 4418 mSDtfsCounter, 1107 mSDsluCounter, 12476 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 16894 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:37,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 16894 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26955 states. [2022-01-10 13:40:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26955 to 23681. [2022-01-10 13:40:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23681 states, 23678 states have (on average 1.1926260663907424) internal successors, (28239), 23680 states have internal predecessors, (28239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23681 states to 23681 states and 28239 transitions. [2022-01-10 13:40:39,235 INFO L78 Accepts]: Start accepts. Automaton has 23681 states and 28239 transitions. Word has length 160 [2022-01-10 13:40:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:39,235 INFO L470 AbstractCegarLoop]: Abstraction has 23681 states and 28239 transitions. [2022-01-10 13:40:39,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23681 states and 28239 transitions. [2022-01-10 13:40:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 13:40:39,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:39,244 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, 1] [2022-01-10 13:40:39,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 13:40:39,244 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash -253730100, now seen corresponding path program 1 times [2022-01-10 13:40:39,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:39,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098726719] [2022-01-10 13:40:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:39,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:39,293 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-10 13:40:39,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:39,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098726719] [2022-01-10 13:40:39,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098726719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:39,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:39,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:40:39,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329279442] [2022-01-10 13:40:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:39,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:40:39,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:39,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:40:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:40:39,295 INFO L87 Difference]: Start difference. First operand 23681 states and 28239 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:40,484 INFO L93 Difference]: Finished difference Result 45503 states and 52830 transitions. [2022-01-10 13:40:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:40:40,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-10 13:40:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:40,515 INFO L225 Difference]: With dead ends: 45503 [2022-01-10 13:40:40,515 INFO L226 Difference]: Without dead ends: 23984 [2022-01-10 13:40:40,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 13:40:40,535 INFO L933 BasicCegarLoop]: 4365 mSDtfsCounter, 872 mSDsluCounter, 12679 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 17044 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:40,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 17044 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23984 states. [2022-01-10 13:40:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23984 to 20228. [2022-01-10 13:40:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20228 states, 20225 states have (on average 1.1853152039555006) internal successors, (23973), 20227 states have internal predecessors, (23973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20228 states to 20228 states and 23973 transitions. [2022-01-10 13:40:41,528 INFO L78 Accepts]: Start accepts. Automaton has 20228 states and 23973 transitions. Word has length 160 [2022-01-10 13:40:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:41,528 INFO L470 AbstractCegarLoop]: Abstraction has 20228 states and 23973 transitions. [2022-01-10 13:40:41,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 20228 states and 23973 transitions. [2022-01-10 13:40:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-10 13:40:41,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:41,537 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, 1] [2022-01-10 13:40:41,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 13:40:41,538 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1028031953, now seen corresponding path program 1 times [2022-01-10 13:40:41,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:41,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679495255] [2022-01-10 13:40:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:41,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 13:40:41,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679495255] [2022-01-10 13:40:41,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679495255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:41,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:41,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:40:41,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182571098] [2022-01-10 13:40:41,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:41,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:40:41,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:41,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:40:41,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:40:41,590 INFO L87 Difference]: Start difference. First operand 20228 states and 23973 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:42,587 INFO L93 Difference]: Finished difference Result 38093 states and 43689 transitions. [2022-01-10 13:40:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:40:42,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 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 199 [2022-01-10 13:40:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:42,613 INFO L225 Difference]: With dead ends: 38093 [2022-01-10 13:40:42,613 INFO L226 Difference]: Without dead ends: 20015 [2022-01-10 13:40:42,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 13:40:42,630 INFO L933 BasicCegarLoop]: 4337 mSDtfsCounter, 1003 mSDsluCounter, 12429 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 16766 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:40:42,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1003 Valid, 16766 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20015 states. [2022-01-10 13:40:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20015 to 17763. [2022-01-10 13:40:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17763 states, 17760 states have (on average 1.1811373873873874) internal successors, (20977), 17762 states have internal predecessors, (20977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17763 states to 17763 states and 20977 transitions. [2022-01-10 13:40:43,507 INFO L78 Accepts]: Start accepts. Automaton has 17763 states and 20977 transitions. Word has length 199 [2022-01-10 13:40:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:43,507 INFO L470 AbstractCegarLoop]: Abstraction has 17763 states and 20977 transitions. [2022-01-10 13:40:43,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 17763 states and 20977 transitions. [2022-01-10 13:40:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-10 13:40:43,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:43,515 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, 1] [2022-01-10 13:40:43,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 13:40:43,515 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2104977100, now seen corresponding path program 1 times [2022-01-10 13:40:43,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:43,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274191452] [2022-01-10 13:40:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:43,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:43,563 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-10 13:40:43,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:43,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274191452] [2022-01-10 13:40:43,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274191452] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:43,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:43,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:40:43,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902541000] [2022-01-10 13:40:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:43,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:40:43,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:40:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:40:43,565 INFO L87 Difference]: Start difference. First operand 17763 states and 20977 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:44,152 INFO L93 Difference]: Finished difference Result 24392 states and 28102 transitions. [2022-01-10 13:40:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:40:44,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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 199 [2022-01-10 13:40:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:44,162 INFO L225 Difference]: With dead ends: 24392 [2022-01-10 13:40:44,163 INFO L226 Difference]: Without dead ends: 6147 [2022-01-10 13:40:44,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 13:40:44,177 INFO L933 BasicCegarLoop]: 4335 mSDtfsCounter, 888 mSDsluCounter, 12411 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 16746 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-10 13:40:44,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 16746 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:40:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2022-01-10 13:40:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5951. [2022-01-10 13:40:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5951 states, 5948 states have (on average 1.3453261600537996) internal successors, (8002), 5950 states have internal predecessors, (8002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5951 states to 5951 states and 8002 transitions. [2022-01-10 13:40:44,408 INFO L78 Accepts]: Start accepts. Automaton has 5951 states and 8002 transitions. Word has length 199 [2022-01-10 13:40:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:44,409 INFO L470 AbstractCegarLoop]: Abstraction has 5951 states and 8002 transitions. [2022-01-10 13:40:44,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5951 states and 8002 transitions. [2022-01-10 13:40:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-01-10 13:40:44,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:44,413 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] [2022-01-10 13:40:44,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 13:40:44,414 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 618376703, now seen corresponding path program 1 times [2022-01-10 13:40:44,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:44,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148384436] [2022-01-10 13:40:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:44,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:44,612 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-10 13:40:44,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:44,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148384436] [2022-01-10 13:40:44,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148384436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:44,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:44,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 13:40:44,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585228045] [2022-01-10 13:40:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:44,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 13:40:44,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:44,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 13:40:44,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 13:40:44,614 INFO L87 Difference]: Start difference. First operand 5951 states and 8002 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:44,996 INFO L93 Difference]: Finished difference Result 5951 states and 8002 transitions. [2022-01-10 13:40:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:40:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 239 [2022-01-10 13:40:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:45,003 INFO L225 Difference]: With dead ends: 5951 [2022-01-10 13:40:45,003 INFO L226 Difference]: Without dead ends: 5949 [2022-01-10 13:40:45,005 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-10 13:40:45,005 INFO L933 BasicCegarLoop]: 4692 mSDtfsCounter, 4547 mSDsluCounter, 14067 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4547 SdHoareTripleChecker+Valid, 18759 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-10 13:40:45,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4547 Valid, 18759 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2022-01-10 13:40:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 5949. [2022-01-10 13:40:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5949 states, 5947 states have (on average 1.3450479233226837) internal successors, (7999), 5948 states have internal predecessors, (7999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 7999 transitions. [2022-01-10 13:40:45,378 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 7999 transitions. Word has length 239 [2022-01-10 13:40:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:45,378 INFO L470 AbstractCegarLoop]: Abstraction has 5949 states and 7999 transitions. [2022-01-10 13:40:45,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 7999 transitions. [2022-01-10 13:40:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-01-10 13:40:45,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:45,382 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-10 13:40:45,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 13:40:45,382 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -356847198, now seen corresponding path program 1 times [2022-01-10 13:40:45,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:45,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443314708] [2022-01-10 13:40:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:45,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:40:45,441 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-10 13:40:45,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:40:45,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443314708] [2022-01-10 13:40:45,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443314708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:40:45,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:40:45,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:40:45,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754364062] [2022-01-10 13:40:45,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:40:45,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:40:45,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:40:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:40:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:45,442 INFO L87 Difference]: Start difference. First operand 5949 states and 7999 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-10 13:40:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:40:45,823 INFO L93 Difference]: Finished difference Result 8109 states and 10258 transitions. [2022-01-10 13:40:45,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:40:45,824 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-10 13:40:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:40:45,832 INFO L225 Difference]: With dead ends: 8109 [2022-01-10 13:40:45,832 INFO L226 Difference]: Without dead ends: 7021 [2022-01-10 13:40:45,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:40:45,835 INFO L933 BasicCegarLoop]: 4595 mSDtfsCounter, 279 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 8903 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-10 13:40:45,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 8903 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:40:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7021 states. [2022-01-10 13:40:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7021 to 5951. [2022-01-10 13:40:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5951 states, 5949 states have (on average 1.3449319213313162) internal successors, (8001), 5950 states have internal predecessors, (8001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:40:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5951 states to 5951 states and 8001 transitions. [2022-01-10 13:40:46,134 INFO L78 Accepts]: Start accepts. Automaton has 5951 states and 8001 transitions. Word has length 243 [2022-01-10 13:40:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:40:46,135 INFO L470 AbstractCegarLoop]: Abstraction has 5951 states and 8001 transitions. [2022-01-10 13:40:46,135 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-10 13:40:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5951 states and 8001 transitions. [2022-01-10 13:40:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-01-10 13:40:46,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:40:46,139 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, 1] [2022-01-10 13:40:46,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 13:40:46,139 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:40:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:40:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1791563729, now seen corresponding path program 1 times [2022-01-10 13:40:46,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:40:46,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278131205] [2022-01-10 13:40:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:40:46,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:40:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 13:40:46,190 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 13:40:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 13:40:46,322 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 13:40:46,322 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 13:40:46,323 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-10 13:40:46,324 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-10 13:40:46,325 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-10 13:40:46,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 13:40:46,327 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] [2022-01-10 13:40:46,330 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 13:40:46,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:40:46 BasicIcfg [2022-01-10 13:40:46,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 13:40:46,902 INFO L158 Benchmark]: Toolchain (without parser) took 57653.76ms. Allocated memory was 218.1MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 179.9MB in the beginning and 5.6GB in the end (delta: -5.4GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2022-01-10 13:40:46,902 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 191.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 13:40:46,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2211.56ms. Allocated memory was 218.1MB in the beginning and 276.8MB in the end (delta: 58.7MB). Free memory was 179.9MB in the beginning and 130.9MB in the end (delta: 49.0MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. [2022-01-10 13:40:46,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 432.71ms. Allocated memory was 276.8MB in the beginning and 485.5MB in the end (delta: 208.7MB). Free memory was 130.9MB in the beginning and 344.3MB in the end (delta: -213.4MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2022-01-10 13:40:46,907 INFO L158 Benchmark]: Boogie Preprocessor took 328.79ms. Allocated memory is still 485.5MB. Free memory was 344.3MB in the beginning and 314.9MB in the end (delta: 29.4MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. [2022-01-10 13:40:46,908 INFO L158 Benchmark]: RCFGBuilder took 6774.94ms. Allocated memory was 485.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 314.9MB in the beginning and 1.2GB in the end (delta: -858.5MB). Peak memory consumption was 273.4MB. Max. memory is 8.0GB. [2022-01-10 13:40:46,908 INFO L158 Benchmark]: IcfgTransformer took 1088.10ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 118.5MB). Peak memory consumption was 206.6MB. Max. memory is 8.0GB. [2022-01-10 13:40:46,909 INFO L158 Benchmark]: TraceAbstraction took 46813.04ms. Allocated memory was 1.6GB in the beginning and 7.3GB in the end (delta: 5.7GB). Free memory was 1.1GB in the beginning and 5.6GB in the end (delta: -4.5GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2022-01-10 13:40:46,910 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.10ms. Allocated memory is still 218.1MB. Free memory is still 191.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2211.56ms. Allocated memory was 218.1MB in the beginning and 276.8MB in the end (delta: 58.7MB). Free memory was 179.9MB in the beginning and 130.9MB in the end (delta: 49.0MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 432.71ms. Allocated memory was 276.8MB in the beginning and 485.5MB in the end (delta: 208.7MB). Free memory was 130.9MB in the beginning and 344.3MB in the end (delta: -213.4MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 328.79ms. Allocated memory is still 485.5MB. Free memory was 344.3MB in the beginning and 314.9MB in the end (delta: 29.4MB). Peak memory consumption was 58.2MB. Max. memory is 8.0GB. * RCFGBuilder took 6774.94ms. Allocated memory was 485.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 314.9MB in the beginning and 1.2GB in the end (delta: -858.5MB). Peak memory consumption was 273.4MB. Max. memory is 8.0GB. * IcfgTransformer took 1088.10ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 118.5MB). Peak memory consumption was 206.6MB. Max. memory is 8.0GB. * TraceAbstraction took 46813.04ms. Allocated memory was 1.6GB in the beginning and 7.3GB in the end (delta: 5.7GB). Free memory was 1.1GB in the beginning and 5.6GB in the end (delta: -4.5GB). Peak memory consumption was 2.3GB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int t3_pc = 0; [L11181] int m_st ; [L11182] int t1_st ; [L11183] int t2_st ; [L11184] int t3_st ; [L11185] int m_i ; [L11186] int t1_i ; [L11187] int t2_i ; [L11188] int t3_i ; [L11189] int M_E = 2; [L11190] int T1_E = 2; [L11191] int T2_E = 2; [L11192] int T3_E = 2; [L11193] int E_M = 2; [L11194] int E_1 = 2; [L11195] int E_2 = 2; [L11196] int E_3 = 2; [L11202] int token ; [L11204] int local ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11901] COND FALSE !(__VERIFIER_nondet_int()) [L11904] CALL main2() [L11888] int __retres1 ; [L11892] CALL init_model() [L11801] m_i = 1 [L11802] t1_i = 1 [L11803] t2_i = 1 [L11804] t3_i = 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11892] RET init_model() [L11893] CALL start_simulation() [L11829] int kernel_st ; [L11830] int tmp ; [L11831] int tmp___0 ; [L11835] kernel_st = 0 [L11836] FCALL update_channels() [L11837] CALL init_threads() [L11457] COND TRUE m_i == 1 [L11458] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11462] COND TRUE t1_i == 1 [L11463] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11467] COND TRUE t2_i == 1 [L11468] t2_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11472] COND TRUE t3_i == 1 [L11473] t3_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11837] RET init_threads() [L11838] CALL fire_delta_events() [L11594] COND FALSE !(M_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11599] COND FALSE !(T1_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11604] COND FALSE !(T2_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11609] COND FALSE !(T3_E == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11614] COND FALSE !(E_M == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11619] COND FALSE !(E_1 == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11624] COND FALSE !(E_2 == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11629] COND FALSE !(E_3 == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11838] RET fire_delta_events() [L11839] CALL activate_threads() [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11373] COND FALSE !(m_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11383] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11385] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11392] COND FALSE !(t1_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11402] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11404] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11411] COND FALSE !(t2_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11421] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11423] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11430] COND FALSE !(t3_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11440] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11442] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11839] RET activate_threads() [L11840] CALL reset_delta_events() [L11642] COND FALSE !(M_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11647] COND FALSE !(T1_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11652] COND FALSE !(T2_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11657] COND FALSE !(T3_E == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11662] COND FALSE !(E_M == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11667] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11672] COND FALSE !(E_2 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11677] COND FALSE !(E_3 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11840] RET reset_delta_events() [L11843] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11846] kernel_st = 1 [L11847] CALL eval() [L11513] int tmp ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11517] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11520] CALL, EXPR exists_runnable_thread() [L11482] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11508] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11520] RET, EXPR exists_runnable_thread() [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND FALSE !(\read(tmp_ndt_1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11541] COND TRUE t1_st == 0 [L11542] int tmp_ndt_2; [L11543] tmp_ndt_2 = __VERIFIER_nondet_int() [L11544] COND TRUE \read(tmp_ndt_2) [L11546] t1_st = 1 [L11547] CALL transmit1() [L11265] COND TRUE t1_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11276] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11278] t1_pc = 1 [L11279] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11547] RET transmit1() [L11555] COND TRUE t2_st == 0 [L11556] int tmp_ndt_3; [L11557] tmp_ndt_3 = __VERIFIER_nondet_int() [L11558] COND TRUE \read(tmp_ndt_3) [L11560] t2_st = 1 [L11561] CALL transmit2() [L11301] COND TRUE t2_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11312] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11314] t2_pc = 1 [L11315] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11561] RET transmit2() [L11569] COND TRUE t3_st == 0 [L11570] int tmp_ndt_4; [L11571] tmp_ndt_4 = __VERIFIER_nondet_int() [L11572] COND TRUE \read(tmp_ndt_4) [L11574] t3_st = 1 [L11575] CALL transmit3() [L11337] COND TRUE t3_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11348] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11350] t3_pc = 1 [L11351] t3_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11575] RET transmit3() [L11517] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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=1, tmp_ndt_3=4, tmp_ndt_4=5, token=0] [L11520] CALL, EXPR exists_runnable_thread() [L11482] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11508] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11520] RET, EXPR exists_runnable_thread() [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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=1, tmp_ndt_3=4, tmp_ndt_4=5, token=0] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND TRUE \read(tmp_ndt_1) [L11532] m_st = 1 [L11533] CALL master() [L11207] int tmp_var = __VERIFIER_nondet_int(); [L11209] COND TRUE m_pc == 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11220] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11223] token = __VERIFIER_nondet_int() [L11224] local = token [L11225] E_1 = 1 [L11226] CALL immediate_notify() [L11734] CALL activate_threads() [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11373] COND FALSE !(m_pc == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11383] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11385] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11392] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11393] COND TRUE E_1 == 1 [L11394] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11404] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND TRUE \read(tmp___0) [L11705] t1_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11411] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11412] COND FALSE !(E_2 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11421] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11423] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11430] COND TRUE t3_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11431] COND FALSE !(E_3 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11440] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11442] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=1, E_2=2, E_3=2, E_M=2, f=6, 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] [L11734] RET activate_threads() [L11226] RET immediate_notify() [L11227] E_1 = 2 [L11228] m_pc = 1 [L11229] m_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11533] RET master() [L11541] COND TRUE t1_st == 0 [L11542] int tmp_ndt_2; [L11543] tmp_ndt_2 = __VERIFIER_nondet_int() [L11544] COND TRUE \read(tmp_ndt_2) [L11546] t1_st = 1 [L11547] CALL transmit1() [L11265] COND FALSE !(t1_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11268] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11284] token += 1 [L11285] E_2 = 1 [L11286] CALL immediate_notify() [L11734] CALL activate_threads() [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11373] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11374] COND FALSE !(E_M == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11383] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11385] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11392] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11393] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11402] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11404] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11411] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11412] COND TRUE E_2 == 1 [L11413] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11423] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND TRUE \read(tmp___1) [L11713] t2_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11430] COND TRUE t3_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11431] COND FALSE !(E_3 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11440] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11442] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=1, E_3=2, E_M=2, f=6, 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] [L11734] RET activate_threads() [L11286] RET immediate_notify() [L11287] E_2 = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11276] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11278] t1_pc = 1 [L11279] t1_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11547] RET transmit1() [L11555] COND TRUE t2_st == 0 [L11556] int tmp_ndt_3; [L11557] tmp_ndt_3 = __VERIFIER_nondet_int() [L11558] COND TRUE \read(tmp_ndt_3) [L11560] t2_st = 1 [L11561] CALL transmit2() [L11301] COND FALSE !(t2_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11304] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11320] token += 1 [L11321] E_3 = 1 [L11322] CALL immediate_notify() [L11734] CALL activate_threads() [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11373] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11374] COND FALSE !(E_M == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11383] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11385] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11392] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11393] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11402] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11404] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11411] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11412] COND FALSE !(E_2 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11421] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11423] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11430] COND TRUE t3_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11431] COND TRUE E_3 == 1 [L11432] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11442] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND TRUE \read(tmp___2) [L11721] t3_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=1, E_M=2, f=6, 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] [L11734] RET activate_threads() [L11322] RET immediate_notify() [L11323] E_3 = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11312] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11314] t2_pc = 1 [L11315] t2_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11561] RET transmit2() [L11569] COND TRUE t3_st == 0 [L11570] int tmp_ndt_4; [L11571] tmp_ndt_4 = __VERIFIER_nondet_int() [L11572] COND TRUE \read(tmp_ndt_4) [L11574] t3_st = 1 [L11575] CALL transmit3() [L11337] COND FALSE !(t3_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11340] COND TRUE t3_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11356] token += 1 [L11357] E_M = 1 [L11358] CALL immediate_notify() [L11734] CALL activate_threads() [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11373] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11374] COND TRUE E_M == 1 [L11375] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11385] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND TRUE \read(tmp) [L11697] m_st = 0 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11392] COND TRUE t1_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11393] COND FALSE !(E_1 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11402] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11404] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11411] COND TRUE t2_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11412] COND FALSE !(E_2 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11421] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11423] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11430] COND TRUE t3_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11431] COND FALSE !(E_3 == 1) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11440] __retres1 = 0 VAL [__retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11442] return (__retres1); VAL [\result=0, __retres1=0, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=1, f=6, 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] [L11734] RET activate_threads() [L11358] RET immediate_notify() [L11359] E_M = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11348] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11350] t3_pc = 1 [L11351] t3_st = 2 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11575] RET transmit3() [L11517] COND TRUE 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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=1, tmp_ndt_3=6, tmp_ndt_4=7, token=3] [L11520] CALL, EXPR exists_runnable_thread() [L11482] int __retres1 ; VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [__retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11508] return (__retres1); VAL [\result=-1, __retres1=1, a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11520] RET, EXPR exists_runnable_thread() [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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=1, tmp_ndt_3=6, tmp_ndt_4=7, token=3] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND TRUE \read(tmp_ndt_1) [L11532] m_st = 1 [L11533] CALL master() [L11207] int tmp_var = __VERIFIER_nondet_int(); [L11209] COND FALSE !(m_pc == 0) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11212] COND TRUE m_pc == 1 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11234] COND FALSE !(token != local + 3) VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11239] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11240] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11245] COND TRUE tmp_var <= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11246] COND TRUE tmp_var >= 5 VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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] [L11247] COND TRUE tmp_var == 5 [L11248] CALL error() [L11173] reach_error() VAL [a=1, a12=4, a15=1, a16=1, a2=10, a20=5, a25=1, a27=1, a9=18, b=2, c=3, d=4, e=5, E_1=2, E_2=2, E_3=2, E_M=2, f=6, 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: 11173]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 11088]: 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, 2516 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 46.2s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81842 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81842 mSDsluCounter, 266171 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118401 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 650 IncrementalHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 147770 mSDtfsCounter, 650 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43294occurred in iteration=19, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 15350 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 4440 NumberOfCodeBlocks, 4440 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4163 ConstructedInterpolants, 0 QuantifiedInterpolants, 9052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 596/596 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-10 13:40:46,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...