/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/combinations/Problem05_label45+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 07:45:02,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 07:45:02,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 07:45:02,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 07:45:02,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 07:45:02,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 07:45:02,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 07:45:02,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 07:45:02,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 07:45:02,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 07:45:02,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 07:45:02,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 07:45:02,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 07:45:02,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 07:45:02,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 07:45:02,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 07:45:02,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 07:45:02,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 07:45:02,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 07:45:02,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 07:45:02,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 07:45:02,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 07:45:02,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 07:45:02,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 07:45:02,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 07:45:02,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 07:45:02,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 07:45:02,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 07:45:02,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 07:45:02,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 07:45:02,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 07:45:02,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 07:45:02,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 07:45:02,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 07:45:02,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 07:45:02,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 07:45:02,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 07:45:02,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 07:45:02,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 07:45:02,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 07:45:02,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 07:45:02,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 07:45:02,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 07:45:02,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 07:45:02,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 07:45:02,131 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 07:45:02,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 07:45:02,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 07:45:02,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 07:45:02,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 07:45:02,132 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 07:45:02,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 07:45:02,133 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 07:45:02,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 07:45:02,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 07:45:02,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 07:45:02,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 07:45:02,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 07:45:02,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 07:45:02,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 07:45:02,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 07:45:02,136 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 07:45:02,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 07:45:02,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 07:45:02,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 07:45:02,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 07:45:02,355 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 07:45:02,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label45+token_ring.02.cil-2.c [2022-01-10 07:45:02,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538c15e76/3a94ce86f96f4b54aca522bfac190bc1/FLAG8d07cdc2f [2022-01-10 07:45:03,042 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 07:45:03,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label45+token_ring.02.cil-2.c [2022-01-10 07:45:03,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538c15e76/3a94ce86f96f4b54aca522bfac190bc1/FLAG8d07cdc2f [2022-01-10 07:45:03,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/538c15e76/3a94ce86f96f4b54aca522bfac190bc1 [2022-01-10 07:45:03,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 07:45:03,480 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 07:45:03,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 07:45:03,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 07:45:03,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 07:45:03,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:45:03" (1/1) ... [2022-01-10 07:45:03,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a71334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:03, skipping insertion in model container [2022-01-10 07:45:03,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:45:03" (1/1) ... [2022-01-10 07:45:03,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 07:45:03,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 07:45:04,863 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.02.cil-2.c[380323,380336] [2022-01-10 07:45:04,883 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.02.cil-2.c[383339,383352] [2022-01-10 07:45:04,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 07:45:05,006 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 07:45:05,596 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.02.cil-2.c[380323,380336] [2022-01-10 07:45:05,600 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.02.cil-2.c[383339,383352] [2022-01-10 07:45:05,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 07:45:05,653 INFO L208 MainTranslator]: Completed translation [2022-01-10 07:45:05,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05 WrapperNode [2022-01-10 07:45:05,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 07:45:05,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 07:45:05,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 07:45:05,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 07:45:05,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:05,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,004 INFO L137 Inliner]: procedures = 49, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12601 [2022-01-10 07:45:06,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 07:45:06,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 07:45:06,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 07:45:06,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 07:45:06,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 07:45:06,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 07:45:06,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 07:45:06,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 07:45:06,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (1/1) ... [2022-01-10 07:45:06,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 07:45:06,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 07:45:06,396 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 07:45:06,401 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 07:45:06,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-01-10 07:45:06,423 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-01-10 07:45:06,423 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-01-10 07:45:06,423 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 07:45:06,423 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-01-10 07:45:06,423 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-01-10 07:45:06,423 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-01-10 07:45:06,423 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-01-10 07:45:06,424 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-01-10 07:45:06,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 07:45:06,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 07:45:06,537 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 07:45:06,538 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 07:45:13,001 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 07:45:13,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 07:45:13,025 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 07:45:13,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:45:13 BoogieIcfgContainer [2022-01-10 07:45:13,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 07:45:13,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 07:45:13,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 07:45:13,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 07:45:13,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 07:45:03" (1/3) ... [2022-01-10 07:45:13,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b862eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 07:45:13, skipping insertion in model container [2022-01-10 07:45:13,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:45:05" (2/3) ... [2022-01-10 07:45:13,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b862eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 07:45:13, skipping insertion in model container [2022-01-10 07:45:13,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:45:13" (3/3) ... [2022-01-10 07:45:13,033 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.02.cil-2.c [2022-01-10 07:45:13,036 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 07:45:13,036 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 07:45:13,072 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 07:45:13,076 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 07:45:13,076 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 07:45:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-10 07:45:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 07:45:13,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:13,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:45:13,118 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:13,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2062992276, now seen corresponding path program 1 times [2022-01-10 07:45:13,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:13,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574042524] [2022-01-10 07:45:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:13,130 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:13,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:13,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:13,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 07:45:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:13,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:13,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:13,457 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 07:45:13,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:13,458 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:13,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574042524] [2022-01-10 07:45:13,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574042524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:13,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:13,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:13,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716428031] [2022-01-10 07:45:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:13,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:13,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:13,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:13,515 INFO L87 Difference]: Start difference. First operand has 2323 states, 2295 states have (on average 1.857516339869281) internal successors, (4263), 2300 states have internal predecessors, (4263), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:13,900 INFO L93 Difference]: Finished difference Result 4770 states and 8798 transitions. [2022-01-10 07:45:13,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:45:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-01-10 07:45:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:13,918 INFO L225 Difference]: With dead ends: 4770 [2022-01-10 07:45:13,918 INFO L226 Difference]: Without dead ends: 2387 [2022-01-10 07:45:13,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:45:13,927 INFO L933 BasicCegarLoop]: 4235 mSDtfsCounter, 4337 mSDsluCounter, 8433 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 12668 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:13,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4347 Valid, 12668 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 07:45:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2022-01-10 07:45:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2376. [2022-01-10 07:45:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8340480274442539) internal successors, (4277), 2336 states have internal predecessors, (4277), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 07:45:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4334 transitions. [2022-01-10 07:45:14,009 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4334 transitions. Word has length 69 [2022-01-10 07:45:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:14,009 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4334 transitions. [2022-01-10 07:45:14,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4334 transitions. [2022-01-10 07:45:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 07:45:14,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:14,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:45:14,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:14,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:14,222 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:14,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:14,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1960277912, now seen corresponding path program 1 times [2022-01-10 07:45:14,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:14,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852756393] [2022-01-10 07:45:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:14,223 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:14,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:14,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 07:45:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:14,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:14,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:14,387 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 07:45:14,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:14,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:14,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852756393] [2022-01-10 07:45:14,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852756393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:14,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:14,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:14,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830463501] [2022-01-10 07:45:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:14,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:14,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:14,390 INFO L87 Difference]: Start difference. First operand 2376 states and 4334 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:14,560 INFO L93 Difference]: Finished difference Result 2621 states and 4702 transitions. [2022-01-10 07:45:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 07:45:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-01-10 07:45:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:14,569 INFO L225 Difference]: With dead ends: 2621 [2022-01-10 07:45:14,569 INFO L226 Difference]: Without dead ends: 2376 [2022-01-10 07:45:14,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:45:14,571 INFO L933 BasicCegarLoop]: 4133 mSDtfsCounter, 4190 mSDsluCounter, 8121 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4200 SdHoareTripleChecker+Valid, 12254 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:14,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4200 Valid, 12254 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-01-10 07:45:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2376. [2022-01-10 07:45:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8310463121783878) internal successors, (4270), 2336 states have internal predecessors, (4270), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 07:45:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4327 transitions. [2022-01-10 07:45:14,613 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4327 transitions. Word has length 69 [2022-01-10 07:45:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:14,614 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4327 transitions. [2022-01-10 07:45:14,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4327 transitions. [2022-01-10 07:45:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 07:45:14,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:14,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:45:14,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:14,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:14,824 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash -432943892, now seen corresponding path program 1 times [2022-01-10 07:45:14,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:14,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350751163] [2022-01-10 07:45:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:14,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:14,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:14,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:14,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 07:45:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:14,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:14,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:15,001 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 07:45:15,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:15,002 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:15,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350751163] [2022-01-10 07:45:15,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350751163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:15,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:15,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:15,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952663531] [2022-01-10 07:45:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:15,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:15,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:15,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:15,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:15,010 INFO L87 Difference]: Start difference. First operand 2376 states and 4327 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:15,182 INFO L93 Difference]: Finished difference Result 2621 states and 4688 transitions. [2022-01-10 07:45:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 07:45:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-01-10 07:45:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:15,190 INFO L225 Difference]: With dead ends: 2621 [2022-01-10 07:45:15,190 INFO L226 Difference]: Without dead ends: 2376 [2022-01-10 07:45:15,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:45:15,192 INFO L933 BasicCegarLoop]: 4130 mSDtfsCounter, 4184 mSDsluCounter, 8117 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4194 SdHoareTripleChecker+Valid, 12247 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:15,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4194 Valid, 12247 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:15,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-01-10 07:45:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2376. [2022-01-10 07:45:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 2332 states have (on average 1.8280445969125214) internal successors, (4263), 2336 states have internal predecessors, (4263), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (28), 27 states have call predecessors, (28), 27 states have call successors, (28) [2022-01-10 07:45:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 4320 transitions. [2022-01-10 07:45:15,235 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 4320 transitions. Word has length 69 [2022-01-10 07:45:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:15,235 INFO L470 AbstractCegarLoop]: Abstraction has 2376 states and 4320 transitions. [2022-01-10 07:45:15,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 4320 transitions. [2022-01-10 07:45:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 07:45:15,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:15,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:45:15,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-01-10 07:45:15,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:15,444 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash 443075114, now seen corresponding path program 1 times [2022-01-10 07:45:15,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:15,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156643372] [2022-01-10 07:45:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:15,445 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:15,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:15,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:15,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 07:45:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:15,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:15,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:15,626 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 07:45:15,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:15,626 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:15,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156643372] [2022-01-10 07:45:15,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156643372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:15,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:15,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:15,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256939355] [2022-01-10 07:45:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:15,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:15,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:15,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:15,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:15,628 INFO L87 Difference]: Start difference. First operand 2376 states and 4320 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:15,852 INFO L93 Difference]: Finished difference Result 2673 states and 4752 transitions. [2022-01-10 07:45:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:45:15,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-01-10 07:45:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:15,860 INFO L225 Difference]: With dead ends: 2673 [2022-01-10 07:45:15,860 INFO L226 Difference]: Without dead ends: 2428 [2022-01-10 07:45:15,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:45:15,862 INFO L933 BasicCegarLoop]: 4128 mSDtfsCounter, 4203 mSDsluCounter, 8112 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4213 SdHoareTripleChecker+Valid, 12240 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:15,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4213 Valid, 12240 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2022-01-10 07:45:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2428. [2022-01-10 07:45:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2378 states have (on average 1.815811606391926) internal successors, (4318), 2382 states have internal predecessors, (4318), 31 states have call successors, (31), 17 states have call predecessors, (31), 17 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2022-01-10 07:45:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4379 transitions. [2022-01-10 07:45:15,947 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4379 transitions. Word has length 69 [2022-01-10 07:45:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:15,948 INFO L470 AbstractCegarLoop]: Abstraction has 2428 states and 4379 transitions. [2022-01-10 07:45:15,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4379 transitions. [2022-01-10 07:45:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 07:45:15,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:15,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:45:15,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:16,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:16,157 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2094697434, now seen corresponding path program 1 times [2022-01-10 07:45:16,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:16,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889908816] [2022-01-10 07:45:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:16,159 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:16,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:16,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 07:45:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:16,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:16,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:16,314 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 07:45:16,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:16,315 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:16,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889908816] [2022-01-10 07:45:16,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889908816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:16,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:16,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:16,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835361845] [2022-01-10 07:45:16,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:16,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:16,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:16,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:16,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:16,316 INFO L87 Difference]: Start difference. First operand 2428 states and 4379 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:16,595 INFO L93 Difference]: Finished difference Result 2777 states and 4870 transitions. [2022-01-10 07:45:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:45:16,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-01-10 07:45:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:16,604 INFO L225 Difference]: With dead ends: 2777 [2022-01-10 07:45:16,604 INFO L226 Difference]: Without dead ends: 2480 [2022-01-10 07:45:16,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 07:45:16,606 INFO L933 BasicCegarLoop]: 4123 mSDtfsCounter, 4197 mSDsluCounter, 8108 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4207 SdHoareTripleChecker+Valid, 12231 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:16,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4207 Valid, 12231 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2022-01-10 07:45:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2480. [2022-01-10 07:45:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2424 states have (on average 1.8023927392739274) internal successors, (4369), 2428 states have internal predecessors, (4369), 33 states have call successors, (33), 21 states have call predecessors, (33), 21 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2022-01-10 07:45:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 4434 transitions. [2022-01-10 07:45:16,652 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 4434 transitions. Word has length 69 [2022-01-10 07:45:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:16,653 INFO L470 AbstractCegarLoop]: Abstraction has 2480 states and 4434 transitions. [2022-01-10 07:45:16,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 07:45:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 4434 transitions. [2022-01-10 07:45:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 07:45:16,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:16,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 07:45:16,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:16,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:16,861 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1034264695, now seen corresponding path program 1 times [2022-01-10 07:45:16,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:16,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825672016] [2022-01-10 07:45:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:16,862 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:16,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:16,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:16,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 07:45:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:16,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:16,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:17,075 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 07:45:17,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:17,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:17,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825672016] [2022-01-10 07:45:17,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825672016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:17,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:17,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 07:45:17,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517831451] [2022-01-10 07:45:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:17,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:17,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:17,077 INFO L87 Difference]: Start difference. First operand 2480 states and 4434 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 07:45:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:17,126 INFO L93 Difference]: Finished difference Result 3149 states and 5321 transitions. [2022-01-10 07:45:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2022-01-10 07:45:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:17,135 INFO L225 Difference]: With dead ends: 3149 [2022-01-10 07:45:17,135 INFO L226 Difference]: Without dead ends: 2801 [2022-01-10 07:45:17,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 07:45:17,137 INFO L933 BasicCegarLoop]: 4184 mSDtfsCounter, 4058 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4058 SdHoareTripleChecker+Valid, 4343 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:17,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4058 Valid, 4343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2022-01-10 07:45:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2799. [2022-01-10 07:45:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2799 states, 2695 states have (on average 1.7499072356215213) internal successors, (4716), 2702 states have internal predecessors, (4716), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 07:45:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 4836 transitions. [2022-01-10 07:45:17,191 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 4836 transitions. Word has length 69 [2022-01-10 07:45:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:17,191 INFO L470 AbstractCegarLoop]: Abstraction has 2799 states and 4836 transitions. [2022-01-10 07:45:17,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 07:45:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 4836 transitions. [2022-01-10 07:45:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 07:45:17,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:17,192 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:17,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:17,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:17,399 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1810478963, now seen corresponding path program 1 times [2022-01-10 07:45:17,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:17,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603551200] [2022-01-10 07:45:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:17,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:17,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:17,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:17,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 07:45:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:17,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:17,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 07:45:17,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:17,630 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:17,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603551200] [2022-01-10 07:45:17,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603551200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:17,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:17,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 07:45:17,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424739490] [2022-01-10 07:45:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:17,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:17,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:17,631 INFO L87 Difference]: Start difference. First operand 2799 states and 4836 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:17,713 INFO L93 Difference]: Finished difference Result 3676 states and 6006 transitions. [2022-01-10 07:45:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:45:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2022-01-10 07:45:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:17,722 INFO L225 Difference]: With dead ends: 3676 [2022-01-10 07:45:17,722 INFO L226 Difference]: Without dead ends: 3009 [2022-01-10 07:45:17,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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 07:45:17,725 INFO L933 BasicCegarLoop]: 4144 mSDtfsCounter, 90 mSDsluCounter, 12471 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 16615 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:17,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 16615 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2022-01-10 07:45:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2817. [2022-01-10 07:45:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2817 states, 2713 states have (on average 1.7427202359012164) internal successors, (4728), 2720 states have internal predecessors, (4728), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 07:45:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4848 transitions. [2022-01-10 07:45:17,783 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4848 transitions. Word has length 111 [2022-01-10 07:45:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:17,783 INFO L470 AbstractCegarLoop]: Abstraction has 2817 states and 4848 transitions. [2022-01-10 07:45:17,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4848 transitions. [2022-01-10 07:45:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 07:45:17,784 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:17,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:17,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:17,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:17,991 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1264888909, now seen corresponding path program 1 times [2022-01-10 07:45:17,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:17,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621803989] [2022-01-10 07:45:17,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:17,993 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:17,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:17,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:17,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 07:45:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:18,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:18,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 07:45:18,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:18,170 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621803989] [2022-01-10 07:45:18,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621803989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:18,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:18,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 07:45:18,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516984699] [2022-01-10 07:45:18,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:18,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:18,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:18,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:18,171 INFO L87 Difference]: Start difference. First operand 2817 states and 4848 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:18,235 INFO L93 Difference]: Finished difference Result 3586 states and 5856 transitions. [2022-01-10 07:45:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:45:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2022-01-10 07:45:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:18,244 INFO L225 Difference]: With dead ends: 3586 [2022-01-10 07:45:18,244 INFO L226 Difference]: Without dead ends: 2901 [2022-01-10 07:45:18,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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 07:45:18,247 INFO L933 BasicCegarLoop]: 4140 mSDtfsCounter, 49 mSDsluCounter, 12434 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16574 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:18,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 16574 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2022-01-10 07:45:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2829. [2022-01-10 07:45:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2725 states have (on average 1.7365137614678898) internal successors, (4732), 2732 states have internal predecessors, (4732), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 07:45:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4852 transitions. [2022-01-10 07:45:18,301 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4852 transitions. Word has length 111 [2022-01-10 07:45:18,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:18,301 INFO L470 AbstractCegarLoop]: Abstraction has 2829 states and 4852 transitions. [2022-01-10 07:45:18,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4852 transitions. [2022-01-10 07:45:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 07:45:18,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:18,303 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:18,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:18,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:18,510 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1489444851, now seen corresponding path program 1 times [2022-01-10 07:45:18,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:18,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030205743] [2022-01-10 07:45:18,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:18,511 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:18,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:18,512 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:18,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 07:45:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:18,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:18,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 07:45:18,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:18,697 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:18,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030205743] [2022-01-10 07:45:18,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030205743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:18,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:18,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 07:45:18,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301940493] [2022-01-10 07:45:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:18,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:18,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:18,699 INFO L87 Difference]: Start difference. First operand 2829 states and 4852 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:18,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:18,822 INFO L93 Difference]: Finished difference Result 3554 states and 5792 transitions. [2022-01-10 07:45:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:45:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2022-01-10 07:45:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:18,832 INFO L225 Difference]: With dead ends: 3554 [2022-01-10 07:45:18,832 INFO L226 Difference]: Without dead ends: 2857 [2022-01-10 07:45:18,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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 07:45:18,834 INFO L933 BasicCegarLoop]: 4140 mSDtfsCounter, 10 mSDsluCounter, 12419 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16559 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:18,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 16559 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2022-01-10 07:45:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2841. [2022-01-10 07:45:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2737 states have (on average 1.7303617099013517) internal successors, (4736), 2744 states have internal predecessors, (4736), 60 states have call successors, (60), 41 states have call predecessors, (60), 42 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 07:45:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 4856 transitions. [2022-01-10 07:45:18,884 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 4856 transitions. Word has length 111 [2022-01-10 07:45:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:18,884 INFO L470 AbstractCegarLoop]: Abstraction has 2841 states and 4856 transitions. [2022-01-10 07:45:18,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:18,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 4856 transitions. [2022-01-10 07:45:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 07:45:18,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:18,885 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:18,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:19,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:19,093 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1271995443, now seen corresponding path program 1 times [2022-01-10 07:45:19,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:19,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536205858] [2022-01-10 07:45:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:19,094 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:19,095 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:19,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 07:45:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:19,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 07:45:19,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 07:45:19,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:19,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:19,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536205858] [2022-01-10 07:45:19,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536205858] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:19,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:19,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:19,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686719460] [2022-01-10 07:45:19,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:19,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:19,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:19,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:19,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:19,313 INFO L87 Difference]: Start difference. First operand 2841 states and 4856 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:19,533 INFO L93 Difference]: Finished difference Result 3665 states and 5884 transitions. [2022-01-10 07:45:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 07:45:19,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2022-01-10 07:45:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:19,544 INFO L225 Difference]: With dead ends: 3665 [2022-01-10 07:45:19,545 INFO L226 Difference]: Without dead ends: 2955 [2022-01-10 07:45:19,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 07:45:19,547 INFO L933 BasicCegarLoop]: 4142 mSDtfsCounter, 4184 mSDsluCounter, 8104 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4193 SdHoareTripleChecker+Valid, 12246 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:19,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4193 Valid, 12246 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-01-10 07:45:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2919. [2022-01-10 07:45:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2811 states have (on average 1.7068658840270365) internal successors, (4798), 2818 states have internal predecessors, (4798), 60 states have call successors, (60), 45 states have call predecessors, (60), 46 states have return successors, (60), 56 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 07:45:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4918 transitions. [2022-01-10 07:45:19,606 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4918 transitions. Word has length 111 [2022-01-10 07:45:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:19,607 INFO L470 AbstractCegarLoop]: Abstraction has 2919 states and 4918 transitions. [2022-01-10 07:45:19,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4918 transitions. [2022-01-10 07:45:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 07:45:19,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:19,608 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:19,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:19,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:19,816 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:19,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1336792015, now seen corresponding path program 1 times [2022-01-10 07:45:19,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:19,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867281278] [2022-01-10 07:45:19,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:19,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:19,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:19,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:19,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 07:45:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:19,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 07:45:19,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 07:45:20,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:20,054 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:20,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867281278] [2022-01-10 07:45:20,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867281278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:20,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:20,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:20,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043733627] [2022-01-10 07:45:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:20,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 07:45:20,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 07:45:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 07:45:20,056 INFO L87 Difference]: Start difference. First operand 2919 states and 4918 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 07:45:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:20,241 INFO L93 Difference]: Finished difference Result 4386 states and 6693 transitions. [2022-01-10 07:45:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:45:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 111 [2022-01-10 07:45:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:20,249 INFO L225 Difference]: With dead ends: 4386 [2022-01-10 07:45:20,249 INFO L226 Difference]: Without dead ends: 3600 [2022-01-10 07:45:20,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:20,252 INFO L933 BasicCegarLoop]: 4203 mSDtfsCounter, 4145 mSDsluCounter, 4222 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4151 SdHoareTripleChecker+Valid, 8425 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:20,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4151 Valid, 8425 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2022-01-10 07:45:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3596. [2022-01-10 07:45:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 3393 states have (on average 1.6177424108458591) internal successors, (5489), 3409 states have internal predecessors, (5489), 109 states have call successors, (109), 81 states have call predecessors, (109), 92 states have return successors, (131), 107 states have call predecessors, (131), 107 states have call successors, (131) [2022-01-10 07:45:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 5729 transitions. [2022-01-10 07:45:20,332 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 5729 transitions. Word has length 111 [2022-01-10 07:45:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:20,333 INFO L470 AbstractCegarLoop]: Abstraction has 3596 states and 5729 transitions. [2022-01-10 07:45:20,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 07:45:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 5729 transitions. [2022-01-10 07:45:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 07:45:20,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:20,335 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:20,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:20,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:20,542 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash -529916659, now seen corresponding path program 1 times [2022-01-10 07:45:20,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:20,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458171558] [2022-01-10 07:45:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:20,543 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:20,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:20,544 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 07:45:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:20,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:20,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-10 07:45:20,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:20,697 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:20,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458171558] [2022-01-10 07:45:20,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458171558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:20,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:20,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:20,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59475739] [2022-01-10 07:45:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:20,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:20,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:20,699 INFO L87 Difference]: Start difference. First operand 3596 states and 5729 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:20,755 INFO L93 Difference]: Finished difference Result 5054 states and 7472 transitions. [2022-01-10 07:45:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:20,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 111 [2022-01-10 07:45:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:20,763 INFO L225 Difference]: With dead ends: 5054 [2022-01-10 07:45:20,763 INFO L226 Difference]: Without dead ends: 3591 [2022-01-10 07:45:20,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 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 07:45:20,766 INFO L933 BasicCegarLoop]: 4138 mSDtfsCounter, 173 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 8096 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 07:45:20,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 8096 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2022-01-10 07:45:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3591. [2022-01-10 07:45:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3591 states, 3391 states have (on average 1.6175169566499559) internal successors, (5485), 3406 states have internal predecessors, (5485), 106 states have call successors, (106), 81 states have call predecessors, (106), 92 states have return successors, (128), 104 states have call predecessors, (128), 104 states have call successors, (128) [2022-01-10 07:45:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 5719 transitions. [2022-01-10 07:45:20,856 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 5719 transitions. Word has length 111 [2022-01-10 07:45:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:20,857 INFO L470 AbstractCegarLoop]: Abstraction has 3591 states and 5719 transitions. [2022-01-10 07:45:20,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 5719 transitions. [2022-01-10 07:45:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 07:45:20,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:20,859 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:20,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-01-10 07:45:21,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:21,066 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash -448833456, now seen corresponding path program 1 times [2022-01-10 07:45:21,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:21,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610091454] [2022-01-10 07:45:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:21,067 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:21,067 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:21,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 07:45:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:21,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 07:45:21,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 07:45:21,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:21,324 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:21,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610091454] [2022-01-10 07:45:21,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610091454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:21,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:21,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:21,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947947533] [2022-01-10 07:45:21,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:21,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 07:45:21,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:21,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 07:45:21,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 07:45:21,326 INFO L87 Difference]: Start difference. First operand 3591 states and 5719 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 07:45:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:21,548 INFO L93 Difference]: Finished difference Result 6239 states and 8912 transitions. [2022-01-10 07:45:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:45:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 112 [2022-01-10 07:45:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:21,559 INFO L225 Difference]: With dead ends: 6239 [2022-01-10 07:45:21,559 INFO L226 Difference]: Without dead ends: 4781 [2022-01-10 07:45:21,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:21,564 INFO L933 BasicCegarLoop]: 4186 mSDtfsCounter, 4140 mSDsluCounter, 4199 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 8385 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:21,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4146 Valid, 8385 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4781 states. [2022-01-10 07:45:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4781 to 4777. [2022-01-10 07:45:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4777 states, 4406 states have (on average 1.5183840217884703) internal successors, (6690), 4438 states have internal predecessors, (6690), 193 states have call successors, (193), 145 states have call predecessors, (193), 176 states have return successors, (259), 195 states have call predecessors, (259), 191 states have call successors, (259) [2022-01-10 07:45:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 7142 transitions. [2022-01-10 07:45:21,676 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 7142 transitions. Word has length 112 [2022-01-10 07:45:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:21,676 INFO L470 AbstractCegarLoop]: Abstraction has 4777 states and 7142 transitions. [2022-01-10 07:45:21,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 07:45:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7142 transitions. [2022-01-10 07:45:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 07:45:21,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:21,679 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:21,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-01-10 07:45:21,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:21,886 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:21,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1979425166, now seen corresponding path program 1 times [2022-01-10 07:45:21,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:21,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153758114] [2022-01-10 07:45:21,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:21,887 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:21,888 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:21,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 07:45:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:21,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:21,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-01-10 07:45:22,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:22,069 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:22,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153758114] [2022-01-10 07:45:22,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153758114] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:22,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:22,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:22,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667437499] [2022-01-10 07:45:22,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:22,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:22,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:22,070 INFO L87 Difference]: Start difference. First operand 4777 states and 7142 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:22,242 INFO L93 Difference]: Finished difference Result 7417 states and 10301 transitions. [2022-01-10 07:45:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:22,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2022-01-10 07:45:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:22,253 INFO L225 Difference]: With dead ends: 7417 [2022-01-10 07:45:22,253 INFO L226 Difference]: Without dead ends: 4773 [2022-01-10 07:45:22,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 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 07:45:22,262 INFO L933 BasicCegarLoop]: 4137 mSDtfsCounter, 171 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 8095 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 07:45:22,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 8095 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:22,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2022-01-10 07:45:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 4773. [2022-01-10 07:45:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4773 states, 4405 states have (on average 1.5182746878547106) internal successors, (6688), 4436 states have internal predecessors, (6688), 190 states have call successors, (190), 145 states have call predecessors, (190), 176 states have return successors, (256), 192 states have call predecessors, (256), 188 states have call successors, (256) [2022-01-10 07:45:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 7134 transitions. [2022-01-10 07:45:22,406 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 7134 transitions. Word has length 112 [2022-01-10 07:45:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:22,407 INFO L470 AbstractCegarLoop]: Abstraction has 4773 states and 7134 transitions. [2022-01-10 07:45:22,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 07:45:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 7134 transitions. [2022-01-10 07:45:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 07:45:22,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:22,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 07:45:22,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:22,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:22,618 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:22,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -148341909, now seen corresponding path program 1 times [2022-01-10 07:45:22,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:22,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343189881] [2022-01-10 07:45:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:22,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:22,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:22,620 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:22,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 07:45:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:22,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:22,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 07:45:22,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:22,816 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343189881] [2022-01-10 07:45:22,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343189881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:22,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:22,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:22,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975259386] [2022-01-10 07:45:22,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:22,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:22,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:22,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:22,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:22,818 INFO L87 Difference]: Start difference. First operand 4773 states and 7134 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 07:45:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:23,017 INFO L93 Difference]: Finished difference Result 9359 states and 12658 transitions. [2022-01-10 07:45:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2022-01-10 07:45:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:23,033 INFO L225 Difference]: With dead ends: 9359 [2022-01-10 07:45:23,034 INFO L226 Difference]: Without dead ends: 5757 [2022-01-10 07:45:23,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 111 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 07:45:23,044 INFO L933 BasicCegarLoop]: 4271 mSDtfsCounter, 133 mSDsluCounter, 4129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 8400 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:23,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 8400 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2022-01-10 07:45:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5757. [2022-01-10 07:45:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5757 states, 5249 states have (on average 1.4610401981329777) internal successors, (7669), 5286 states have internal predecessors, (7669), 266 states have call successors, (266), 201 states have call predecessors, (266), 240 states have return successors, (366), 270 states have call predecessors, (366), 264 states have call successors, (366) [2022-01-10 07:45:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 8301 transitions. [2022-01-10 07:45:23,209 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 8301 transitions. Word has length 113 [2022-01-10 07:45:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:23,210 INFO L470 AbstractCegarLoop]: Abstraction has 5757 states and 8301 transitions. [2022-01-10 07:45:23,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 07:45:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 8301 transitions. [2022-01-10 07:45:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-01-10 07:45:23,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:23,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2022-01-10 07:45:23,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:23,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:23,422 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 734101987, now seen corresponding path program 1 times [2022-01-10 07:45:23,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:23,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178333256] [2022-01-10 07:45:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:23,423 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:23,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:23,424 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:23,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 07:45:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:23,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:23,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 07:45:23,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:23,688 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:23,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178333256] [2022-01-10 07:45:23,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178333256] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:23,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:23,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 07:45:23,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132345299] [2022-01-10 07:45:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:23,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:23,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:23,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:23,689 INFO L87 Difference]: Start difference. First operand 5757 states and 8301 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 07:45:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:23,827 INFO L93 Difference]: Finished difference Result 10372 states and 13817 transitions. [2022-01-10 07:45:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:23,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 144 [2022-01-10 07:45:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:23,845 INFO L225 Difference]: With dead ends: 10372 [2022-01-10 07:45:23,845 INFO L226 Difference]: Without dead ends: 6747 [2022-01-10 07:45:23,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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 07:45:23,855 INFO L933 BasicCegarLoop]: 4148 mSDtfsCounter, 4024 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4024 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:23,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4024 Valid, 4304 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6747 states. [2022-01-10 07:45:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6747 to 6723. [2022-01-10 07:45:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6723 states, 6075 states have (on average 1.4158024691358024) internal successors, (8601), 6118 states have internal predecessors, (8601), 342 states have call successors, (342), 257 states have call predecessors, (342), 304 states have return successors, (462), 348 states have call predecessors, (462), 340 states have call successors, (462) [2022-01-10 07:45:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6723 states to 6723 states and 9405 transitions. [2022-01-10 07:45:24,026 INFO L78 Accepts]: Start accepts. Automaton has 6723 states and 9405 transitions. Word has length 144 [2022-01-10 07:45:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:24,026 INFO L470 AbstractCegarLoop]: Abstraction has 6723 states and 9405 transitions. [2022-01-10 07:45:24,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 07:45:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6723 states and 9405 transitions. [2022-01-10 07:45:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 07:45:24,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:24,031 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:24,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:24,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:24,238 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:24,239 INFO L85 PathProgramCache]: Analyzing trace with hash 674183406, now seen corresponding path program 1 times [2022-01-10 07:45:24,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:24,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882547242] [2022-01-10 07:45:24,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:24,240 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:24,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:24,241 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:24,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 07:45:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:24,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:24,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-10 07:45:24,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:24,520 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882547242] [2022-01-10 07:45:24,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882547242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:24,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:24,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 07:45:24,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013571228] [2022-01-10 07:45:24,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:24,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 07:45:24,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 07:45:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 07:45:24,522 INFO L87 Difference]: Start difference. First operand 6723 states and 9405 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 07:45:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:24,803 INFO L93 Difference]: Finished difference Result 11355 states and 14924 transitions. [2022-01-10 07:45:24,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:45:24,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 162 [2022-01-10 07:45:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:24,819 INFO L225 Difference]: With dead ends: 11355 [2022-01-10 07:45:24,819 INFO L226 Difference]: Without dead ends: 6765 [2022-01-10 07:45:24,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:24,828 INFO L933 BasicCegarLoop]: 4139 mSDtfsCounter, 4138 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 8312 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:24,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4144 Valid, 8312 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 07:45:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2022-01-10 07:45:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6765. [2022-01-10 07:45:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6765 states, 6109 states have (on average 1.4059584220003274) internal successors, (8589), 6156 states have internal predecessors, (8589), 342 states have call successors, (342), 257 states have call predecessors, (342), 312 states have return successors, (420), 352 states have call predecessors, (420), 340 states have call successors, (420) [2022-01-10 07:45:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6765 states to 6765 states and 9351 transitions. [2022-01-10 07:45:25,000 INFO L78 Accepts]: Start accepts. Automaton has 6765 states and 9351 transitions. Word has length 162 [2022-01-10 07:45:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:25,000 INFO L470 AbstractCegarLoop]: Abstraction has 6765 states and 9351 transitions. [2022-01-10 07:45:25,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 07:45:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6765 states and 9351 transitions. [2022-01-10 07:45:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 07:45:25,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:25,004 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:25,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:25,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:25,211 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1542185064, now seen corresponding path program 1 times [2022-01-10 07:45:25,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:25,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763124855] [2022-01-10 07:45:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:25,212 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:25,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:25,213 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:25,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 07:45:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:25,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:25,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 07:45:25,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:25,447 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:25,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763124855] [2022-01-10 07:45:25,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763124855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:25,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:25,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:25,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334460937] [2022-01-10 07:45:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:25,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:25,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:25,449 INFO L87 Difference]: Start difference. First operand 6765 states and 9351 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 07:45:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:25,593 INFO L93 Difference]: Finished difference Result 10441 states and 13649 transitions. [2022-01-10 07:45:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-01-10 07:45:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:25,613 INFO L225 Difference]: With dead ends: 10441 [2022-01-10 07:45:25,613 INFO L226 Difference]: Without dead ends: 6769 [2022-01-10 07:45:25,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 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 07:45:25,621 INFO L933 BasicCegarLoop]: 4258 mSDtfsCounter, 132 mSDsluCounter, 4129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 8387 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:25,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 8387 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2022-01-10 07:45:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 6765. [2022-01-10 07:45:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6765 states, 6109 states have (on average 1.4036667212309708) internal successors, (8575), 6156 states have internal predecessors, (8575), 342 states have call successors, (342), 257 states have call predecessors, (342), 312 states have return successors, (414), 352 states have call predecessors, (414), 340 states have call successors, (414) [2022-01-10 07:45:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6765 states to 6765 states and 9331 transitions. [2022-01-10 07:45:25,800 INFO L78 Accepts]: Start accepts. Automaton has 6765 states and 9331 transitions. Word has length 163 [2022-01-10 07:45:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:25,800 INFO L470 AbstractCegarLoop]: Abstraction has 6765 states and 9331 transitions. [2022-01-10 07:45:25,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 07:45:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6765 states and 9331 transitions. [2022-01-10 07:45:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-10 07:45:25,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:25,806 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:25,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:26,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:26,014 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:26,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2040341066, now seen corresponding path program 1 times [2022-01-10 07:45:26,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:26,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174752158] [2022-01-10 07:45:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:26,015 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:26,016 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:26,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 07:45:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:26,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:26,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-01-10 07:45:26,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:26,356 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:26,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174752158] [2022-01-10 07:45:26,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174752158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:26,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:26,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 07:45:26,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472960018] [2022-01-10 07:45:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:26,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:26,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:26,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:26,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:26,357 INFO L87 Difference]: Start difference. First operand 6765 states and 9331 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-10 07:45:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:26,511 INFO L93 Difference]: Finished difference Result 12236 states and 15651 transitions. [2022-01-10 07:45:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:26,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 194 [2022-01-10 07:45:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:26,532 INFO L225 Difference]: With dead ends: 12236 [2022-01-10 07:45:26,533 INFO L226 Difference]: Without dead ends: 7603 [2022-01-10 07:45:26,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 192 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 07:45:26,543 INFO L933 BasicCegarLoop]: 4176 mSDtfsCounter, 4005 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4005 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:26,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4005 Valid, 4332 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7603 states. [2022-01-10 07:45:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7603 to 7571. [2022-01-10 07:45:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7571 states, 6795 states have (on average 1.3720382634289918) internal successors, (9323), 6846 states have internal predecessors, (9323), 410 states have call successors, (410), 305 states have call predecessors, (410), 364 states have return successors, (486), 420 states have call predecessors, (486), 408 states have call successors, (486) [2022-01-10 07:45:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 10219 transitions. [2022-01-10 07:45:26,823 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 10219 transitions. Word has length 194 [2022-01-10 07:45:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:26,824 INFO L470 AbstractCegarLoop]: Abstraction has 7571 states and 10219 transitions. [2022-01-10 07:45:26,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-01-10 07:45:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 10219 transitions. [2022-01-10 07:45:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 07:45:26,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:26,830 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:26,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:27,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:27,037 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 791669233, now seen corresponding path program 1 times [2022-01-10 07:45:27,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:27,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547216736] [2022-01-10 07:45:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:27,038 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:27,039 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:27,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 07:45:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:27,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:27,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 07:45:27,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:27,332 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:27,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547216736] [2022-01-10 07:45:27,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547216736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:27,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:27,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:27,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636992668] [2022-01-10 07:45:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:27,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:27,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:27,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:27,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:27,333 INFO L87 Difference]: Start difference. First operand 7571 states and 10219 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:27,435 INFO L93 Difference]: Finished difference Result 9509 states and 12444 transitions. [2022-01-10 07:45:27,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:27,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 198 [2022-01-10 07:45:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:27,446 INFO L225 Difference]: With dead ends: 9509 [2022-01-10 07:45:27,446 INFO L226 Difference]: Without dead ends: 3835 [2022-01-10 07:45:27,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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 07:45:27,454 INFO L933 BasicCegarLoop]: 4217 mSDtfsCounter, 135 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8316 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:27,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 8316 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2022-01-10 07:45:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3835. [2022-01-10 07:45:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3835 states, 3579 states have (on average 1.5560212349818385) internal successors, (5569), 3592 states have internal predecessors, (5569), 146 states have call successors, (146), 101 states have call predecessors, (146), 108 states have return successors, (152), 142 states have call predecessors, (152), 144 states have call successors, (152) [2022-01-10 07:45:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5867 transitions. [2022-01-10 07:45:27,527 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5867 transitions. Word has length 198 [2022-01-10 07:45:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:27,528 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 5867 transitions. [2022-01-10 07:45:27,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5867 transitions. [2022-01-10 07:45:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 07:45:27,531 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:27,531 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:27,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:27,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:27,738 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1432983761, now seen corresponding path program 1 times [2022-01-10 07:45:27,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:27,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179052073] [2022-01-10 07:45:27,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:27,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:27,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:27,741 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:27,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 07:45:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:27,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:27,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-10 07:45:28,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:28,001 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:28,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179052073] [2022-01-10 07:45:28,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179052073] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:28,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:28,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:28,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739579051] [2022-01-10 07:45:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:28,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:28,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:28,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:28,003 INFO L87 Difference]: Start difference. First operand 3835 states and 5867 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:28,068 INFO L93 Difference]: Finished difference Result 4948 states and 7140 transitions. [2022-01-10 07:45:28,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:28,068 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), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 198 [2022-01-10 07:45:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:28,079 INFO L225 Difference]: With dead ends: 4948 [2022-01-10 07:45:28,079 INFO L226 Difference]: Without dead ends: 3835 [2022-01-10 07:45:28,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 196 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 07:45:28,083 INFO L933 BasicCegarLoop]: 4247 mSDtfsCounter, 127 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 8337 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:28,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 8337 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:28,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2022-01-10 07:45:28,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3835. [2022-01-10 07:45:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3835 states, 3579 states have (on average 1.5515507124895223) internal successors, (5553), 3592 states have internal predecessors, (5553), 146 states have call successors, (146), 101 states have call predecessors, (146), 108 states have return successors, (152), 142 states have call predecessors, (152), 144 states have call successors, (152) [2022-01-10 07:45:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3835 states to 3835 states and 5851 transitions. [2022-01-10 07:45:28,162 INFO L78 Accepts]: Start accepts. Automaton has 3835 states and 5851 transitions. Word has length 198 [2022-01-10 07:45:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:28,163 INFO L470 AbstractCegarLoop]: Abstraction has 3835 states and 5851 transitions. [2022-01-10 07:45:28,163 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), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3835 states and 5851 transitions. [2022-01-10 07:45:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-10 07:45:28,166 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:28,166 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:28,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:28,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:28,374 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1626389213, now seen corresponding path program 1 times [2022-01-10 07:45:28,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:28,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125322779] [2022-01-10 07:45:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:28,375 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:28,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:28,376 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:28,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 07:45:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:28,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:28,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 07:45:28,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:28,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:28,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125322779] [2022-01-10 07:45:28,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125322779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:28,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:28,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:28,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707368848] [2022-01-10 07:45:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:28,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:28,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:28,668 INFO L87 Difference]: Start difference. First operand 3835 states and 5851 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:28,762 INFO L93 Difference]: Finished difference Result 5599 states and 7852 transitions. [2022-01-10 07:45:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:28,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2022-01-10 07:45:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:28,775 INFO L225 Difference]: With dead ends: 5599 [2022-01-10 07:45:28,775 INFO L226 Difference]: Without dead ends: 4060 [2022-01-10 07:45:28,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 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 07:45:28,781 INFO L933 BasicCegarLoop]: 4153 mSDtfsCounter, 4078 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4078 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:28,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4078 Valid, 4305 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2022-01-10 07:45:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 4058. [2022-01-10 07:45:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4058 states, 3768 states have (on average 1.5257430997876857) internal successors, (5749), 3784 states have internal predecessors, (5749), 165 states have call successors, (165), 115 states have call predecessors, (165), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2022-01-10 07:45:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 6093 transitions. [2022-01-10 07:45:28,870 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 6093 transitions. Word has length 200 [2022-01-10 07:45:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:28,870 INFO L470 AbstractCegarLoop]: Abstraction has 4058 states and 6093 transitions. [2022-01-10 07:45:28,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 6093 transitions. [2022-01-10 07:45:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-01-10 07:45:28,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:28,874 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:28,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-01-10 07:45:29,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:29,081 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1725156702, now seen corresponding path program 1 times [2022-01-10 07:45:29,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:29,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646234232] [2022-01-10 07:45:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:29,082 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:29,083 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:29,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 07:45:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:29,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:29,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 07:45:29,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:29,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:29,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646234232] [2022-01-10 07:45:29,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646234232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:29,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:29,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:29,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289428326] [2022-01-10 07:45:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:29,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:29,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:29,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:29,425 INFO L87 Difference]: Start difference. First operand 4058 states and 6093 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:29,501 INFO L93 Difference]: Finished difference Result 5629 states and 7856 transitions. [2022-01-10 07:45:29,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:29,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 201 [2022-01-10 07:45:29,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:29,509 INFO L225 Difference]: With dead ends: 5629 [2022-01-10 07:45:29,510 INFO L226 Difference]: Without dead ends: 4058 [2022-01-10 07:45:29,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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 07:45:29,514 INFO L933 BasicCegarLoop]: 4200 mSDtfsCounter, 124 mSDsluCounter, 4072 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 8272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:29,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 8272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-01-10 07:45:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4058. [2022-01-10 07:45:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4058 states, 3768 states have (on average 1.5209660297239915) internal successors, (5731), 3784 states have internal predecessors, (5731), 165 states have call successors, (165), 115 states have call predecessors, (165), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2022-01-10 07:45:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 6075 transitions. [2022-01-10 07:45:29,661 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 6075 transitions. Word has length 201 [2022-01-10 07:45:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:29,662 INFO L470 AbstractCegarLoop]: Abstraction has 4058 states and 6075 transitions. [2022-01-10 07:45:29,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 07:45:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 6075 transitions. [2022-01-10 07:45:29,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-01-10 07:45:29,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:29,665 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:29,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-01-10 07:45:29,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:29,871 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1365063130, now seen corresponding path program 1 times [2022-01-10 07:45:29,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:29,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2898362] [2022-01-10 07:45:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:29,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:29,874 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:29,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 07:45:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:29,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 07:45:29,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 92 proven. 70 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 07:45:30,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 07:45:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 07:45:30,593 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:30,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2898362] [2022-01-10 07:45:30,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2898362] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 07:45:30,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 07:45:30,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2022-01-10 07:45:30,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300769868] [2022-01-10 07:45:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:30,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 07:45:30,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 07:45:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:30,594 INFO L87 Difference]: Start difference. First operand 4058 states and 6075 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 07:45:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:30,838 INFO L93 Difference]: Finished difference Result 4064 states and 6080 transitions. [2022-01-10 07:45:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 07:45:30,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 203 [2022-01-10 07:45:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:30,846 INFO L225 Difference]: With dead ends: 4064 [2022-01-10 07:45:30,846 INFO L226 Difference]: Without dead ends: 4061 [2022-01-10 07:45:30,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 07:45:30,848 INFO L933 BasicCegarLoop]: 4329 mSDtfsCounter, 4298 mSDsluCounter, 8514 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 12843 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 07:45:30,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4298 Valid, 12843 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 07:45:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2022-01-10 07:45:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 4057. [2022-01-10 07:45:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4057 states, 3768 states have (on average 1.520435244161359) internal successors, (5729), 3783 states have internal predecessors, (5729), 164 states have call successors, (164), 115 states have call predecessors, (164), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2022-01-10 07:45:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 4057 states and 6072 transitions. [2022-01-10 07:45:30,939 INFO L78 Accepts]: Start accepts. Automaton has 4057 states and 6072 transitions. Word has length 203 [2022-01-10 07:45:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:30,939 INFO L470 AbstractCegarLoop]: Abstraction has 4057 states and 6072 transitions. [2022-01-10 07:45:30,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 5 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 07:45:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4057 states and 6072 transitions. [2022-01-10 07:45:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-01-10 07:45:30,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:30,943 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:30,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:31,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:31,150 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash -575528242, now seen corresponding path program 1 times [2022-01-10 07:45:31,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:31,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018643692] [2022-01-10 07:45:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:31,151 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:31,152 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:31,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-01-10 07:45:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 07:45:31,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 07:45:31,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 07:45:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-01-10 07:45:31,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 07:45:31,454 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 07:45:31,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018643692] [2022-01-10 07:45:31,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018643692] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 07:45:31,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 07:45:31,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 07:45:31,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606323394] [2022-01-10 07:45:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 07:45:31,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 07:45:31,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 07:45:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 07:45:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 07:45:31,455 INFO L87 Difference]: Start difference. First operand 4057 states and 6072 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-10 07:45:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 07:45:31,580 INFO L93 Difference]: Finished difference Result 5368 states and 7586 transitions. [2022-01-10 07:45:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 07:45:31,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 207 [2022-01-10 07:45:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 07:45:31,590 INFO L225 Difference]: With dead ends: 5368 [2022-01-10 07:45:31,590 INFO L226 Difference]: Without dead ends: 4373 [2022-01-10 07:45:31,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 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 07:45:31,594 INFO L933 BasicCegarLoop]: 4211 mSDtfsCounter, 58 mSDsluCounter, 4132 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 8343 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 07:45:31,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 8343 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 07:45:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2022-01-10 07:45:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4059. [2022-01-10 07:45:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 3770 states have (on average 1.5201591511936339) internal successors, (5731), 3785 states have internal predecessors, (5731), 164 states have call successors, (164), 115 states have call predecessors, (164), 123 states have return successors, (179), 159 states have call predecessors, (179), 163 states have call successors, (179) [2022-01-10 07:45:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 6074 transitions. [2022-01-10 07:45:31,703 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 6074 transitions. Word has length 207 [2022-01-10 07:45:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 07:45:31,704 INFO L470 AbstractCegarLoop]: Abstraction has 4059 states and 6074 transitions. [2022-01-10 07:45:31,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-01-10 07:45:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 6074 transitions. [2022-01-10 07:45:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-01-10 07:45:31,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 07:45:31,708 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 07:45:31,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:31,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:31,915 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 07:45:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 07:45:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 567683991, now seen corresponding path program 1 times [2022-01-10 07:45:31,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 07:45:31,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439122783] [2022-01-10 07:45:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 07:45:31,916 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 07:45:31,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 07:45:31,917 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 07:45:31,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-01-10 07:45:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 07:45:32,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 07:45:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 07:45:32,268 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 07:45:32,268 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 07:45:32,269 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 07:45:32,270 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 07:45:32,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-01-10 07:45:32,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 07:45:32,481 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] [2022-01-10 07:45:32,484 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 07:45:32,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 07:45:32 BoogieIcfgContainer [2022-01-10 07:45:32,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 07:45:32,592 INFO L158 Benchmark]: Toolchain (without parser) took 29111.92ms. Allocated memory was 172.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 127.6MB in the beginning and 828.2MB in the end (delta: -700.6MB). Peak memory consumption was 733.7MB. Max. memory is 8.0GB. [2022-01-10 07:45:32,592 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 07:45:32,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2172.44ms. Allocated memory was 172.0MB in the beginning and 262.1MB in the end (delta: 90.2MB). Free memory was 127.6MB in the beginning and 153.9MB in the end (delta: -26.3MB). Peak memory consumption was 197.9MB. Max. memory is 8.0GB. [2022-01-10 07:45:32,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 350.50ms. Allocated memory was 262.1MB in the beginning and 380.6MB in the end (delta: 118.5MB). Free memory was 153.9MB in the beginning and 243.6MB in the end (delta: -89.7MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. [2022-01-10 07:45:32,593 INFO L158 Benchmark]: Boogie Preprocessor took 366.14ms. Allocated memory is still 380.6MB. Free memory was 243.6MB in the beginning and 213.2MB in the end (delta: 30.4MB). Peak memory consumption was 62.4MB. Max. memory is 8.0GB. [2022-01-10 07:45:32,593 INFO L158 Benchmark]: RCFGBuilder took 6656.09ms. Allocated memory was 380.6MB in the beginning and 1.2GB in the end (delta: 816.8MB). Free memory was 213.2MB in the beginning and 793.3MB in the end (delta: -580.2MB). Peak memory consumption was 236.7MB. Max. memory is 8.0GB. [2022-01-10 07:45:32,593 INFO L158 Benchmark]: TraceAbstraction took 19562.71ms. Allocated memory was 1.2GB in the beginning and 1.6GB in the end (delta: 407.9MB). Free memory was 792.8MB in the beginning and 828.2MB in the end (delta: -35.4MB). Peak memory consumption was 372.0MB. Max. memory is 8.0GB. [2022-01-10 07:45:32,594 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2172.44ms. Allocated memory was 172.0MB in the beginning and 262.1MB in the end (delta: 90.2MB). Free memory was 127.6MB in the beginning and 153.9MB in the end (delta: -26.3MB). Peak memory consumption was 197.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 350.50ms. Allocated memory was 262.1MB in the beginning and 380.6MB in the end (delta: 118.5MB). Free memory was 153.9MB in the beginning and 243.6MB in the end (delta: -89.7MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 366.14ms. Allocated memory is still 380.6MB. Free memory was 243.6MB in the beginning and 213.2MB in the end (delta: 30.4MB). Peak memory consumption was 62.4MB. Max. memory is 8.0GB. * RCFGBuilder took 6656.09ms. Allocated memory was 380.6MB in the beginning and 1.2GB in the end (delta: 816.8MB). Free memory was 213.2MB in the beginning and 793.3MB in the end (delta: -580.2MB). Peak memory consumption was 236.7MB. Max. memory is 8.0GB. * TraceAbstraction took 19562.71ms. Allocated memory was 1.2GB in the beginning and 1.6GB in the end (delta: 407.9MB). Free memory was 792.8MB in the beginning and 828.2MB in the end (delta: -35.4MB). Peak memory consumption was 372.0MB. 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 m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] 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_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, token=0] [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_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_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, token=0] [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_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_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, token=0] [L11711] FCALL update_channels() 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_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, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] 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_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, token=0] [L11401] COND TRUE t1_i == 1 [L11402] 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_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, token=0] [L11406] COND TRUE t2_i == 1 [L11407] 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_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, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11509] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11524] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11713] RET fire_delta_events() 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_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, token=0] [L11714] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11343] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \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_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, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11360] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11362] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \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_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, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, token=0] [L11381] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \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_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, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=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_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, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] RET activate_threads() 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_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, token=0] [L11715] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11547] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11562] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, 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_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, token=0] [L11715] RET reset_delta_events() 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_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, token=0] [L11718] 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_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, token=0] [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] 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_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, token=0] [L11446] 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_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, token=0] [L11449] CALL, EXPR exists_runnable_thread() 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_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, token=0] [L11416] 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_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, token=0] [L11419] COND TRUE m_st == 0 [L11420] __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_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, token=0] [L11437] 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_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, token=0] [L11449] RET, EXPR exists_runnable_thread() 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_M=2, exists_runnable_thread()=1, 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, token=0] [L11449] tmp = exists_runnable_thread() [L11451] 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_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, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] 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_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, tmp=1, tmp_ndt_1=0, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] 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_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, token=0] [L11270] 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_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, token=0] [L11272] t1_pc = 1 [L11273] 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_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, token=0] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] 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_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, token=0] [L11306] 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_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, token=0] [L11308] t2_pc = 1 [L11309] 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_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, token=0] [L11490] RET transmit2() [L11446] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, token=0] [L11449] CALL, EXPR exists_runnable_thread() 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_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, token=0] [L11416] 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_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, token=0] [L11419] COND TRUE m_st == 0 [L11420] __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_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, token=0] [L11437] 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_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, token=0] [L11449] RET, EXPR exists_runnable_thread() 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_M=2, exists_runnable_thread()=1, 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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, token=0] [L11449] tmp = exists_runnable_thread() [L11451] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] 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_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, token=0] [L11214] 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_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, token=0] [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] 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=1, E_2=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, token=0] [L11220] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11620] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11341] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __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_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, token=0] [L11343] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \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_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, token=0] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __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_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, token=0] [L11362] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \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_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, token=0] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11379] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __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_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, token=0] [L11381] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \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_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, token=0] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, 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_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, token=0] [L11220] RET immediate_notify() 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_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, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] 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_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, token=0] [L11462] RET master() [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE \read(tmp_ndt_2) [L11475] t1_st = 1 [L11476] CALL transmit1() [L11259] 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_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, token=0] [L11262] 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_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, token=0] [L11278] token += 1 [L11279] 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=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=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11332] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11341] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __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_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, token=1] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \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_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, token=1] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __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_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, token=1] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \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_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, token=1] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __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_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, token=1] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \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_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, token=1] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, 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_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, token=1] [L11280] RET immediate_notify() 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_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, token=1] [L11281] 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_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, token=1] [L11270] 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_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, token=1] [L11272] t1_pc = 1 [L11273] 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_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, token=1] [L11476] RET transmit1() [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE \read(tmp_ndt_3) [L11489] t2_st = 1 [L11490] CALL transmit2() [L11295] 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_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, token=1] [L11298] 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_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, token=1] [L11314] token += 1 [L11315] 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_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=1, token=2] [L11316] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11620] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11343] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \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_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=1, token=2] [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11360] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __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_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=1, token=2] [L11362] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \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_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=1, token=2] [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11379] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __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_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=1, token=2] [L11381] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \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_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=1, token=2] [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=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_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=1, token=2] [L11316] RET immediate_notify() 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_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=1, token=2] [L11317] 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_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=1, token=2] [L11306] 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_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=1, token=2] [L11308] t2_pc = 1 [L11309] 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_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, token=2] [L11490] RET transmit2() [L11446] 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_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, tmp=1, tmp_ndt_1=2147483648, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, token=2] [L11449] CALL, EXPR exists_runnable_thread() 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_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, token=2] [L11416] 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_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, token=2] [L11419] COND TRUE m_st == 0 [L11420] __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_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, token=2] [L11437] 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_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, token=2] [L11449] RET, EXPR exists_runnable_thread() 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_M=2, exists_runnable_thread()=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, tmp=1, tmp_ndt_1=2147483648, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, token=2] [L11449] tmp = exists_runnable_thread() [L11451] 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_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, tmp=1, tmp_ndt_1=2147483648, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] 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_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, token=2] [L11206] 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_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, token=2] [L11228] COND FALSE !(token != local + 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_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, token=2] [L11233] 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_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, tmp_var=5, token=2] [L11234] 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_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, tmp_var=5, token=2] [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_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, tmp_var=5, token=2] [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_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, tmp_var=5, token=2] [L11241] 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_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, tmp_var=5, token=2] [L11242] CALL 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_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, token=2] [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_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, token=2] - 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 8 procedures, 2323 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59471 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59383 mSDsluCounter, 245129 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140617 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 104512 mSDtfsCounter, 1511 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3483 GetRequests, 3417 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7571occurred in iteration=19, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 717 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 3495 NumberOfCodeBlocks, 3495 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3464 ConstructedInterpolants, 0 QuantifiedInterpolants, 5604 SizeOfPredicates, 6 NumberOfNonLiveVariables, 6417 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 26 InterpolantComputations, 25 PerfectInterpolantSequences, 1847/1917 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 07:45:32,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...