/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/pc_sfifo_1.cil-2+token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 08:18:02,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 08:18:02,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 08:18:02,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 08:18:02,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 08:18:02,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 08:18:02,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 08:18:02,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 08:18:02,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 08:18:02,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 08:18:02,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 08:18:02,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 08:18:02,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 08:18:02,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 08:18:02,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 08:18:02,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 08:18:02,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 08:18:02,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 08:18:02,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 08:18:02,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 08:18:02,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 08:18:02,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 08:18:02,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 08:18:02,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 08:18:02,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 08:18:02,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 08:18:02,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 08:18:02,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 08:18:02,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 08:18:02,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 08:18:02,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 08:18:02,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 08:18:02,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 08:18:02,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 08:18:02,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 08:18:02,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 08:18:02,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 08:18:02,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 08:18:02,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 08:18:02,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 08:18:02,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 08:18:02,622 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 08:18:02,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 08:18:02,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 08:18:02,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 08:18:02,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 08:18:02,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 08:18:02,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 08:18:02,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 08:18:02,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 08:18:02,637 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 08:18:02,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 08:18:02,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 08:18:02,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 08:18:02,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 08:18:02,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 08:18:02,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 08:18:02,638 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 08:18:02,638 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 08:18:02,639 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 08:18:02,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 08:18:02,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 08:18:02,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 08:18:02,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 08:18:02,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 08:18:02,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:18:02,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 08:18:02,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 08:18:02,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 08:18:02,640 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 08:18:02,640 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 08:18:02,640 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 08:18:02,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 08:18:02,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 08:18:02,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 08:18:02,640 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 08:18:02,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 08:18:02,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 08:18:02,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 08:18:02,839 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 08:18:02,839 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 08:18:02,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2022-01-10 08:18:02,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed8d5036/50e307e26b5d4e8e827c55d897017218/FLAGf35a388de [2022-01-10 08:18:03,210 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 08:18:03,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2022-01-10 08:18:03,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed8d5036/50e307e26b5d4e8e827c55d897017218/FLAGf35a388de [2022-01-10 08:18:03,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed8d5036/50e307e26b5d4e8e827c55d897017218 [2022-01-10 08:18:03,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 08:18:03,608 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 08:18:03,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 08:18:03,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 08:18:03,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 08:18:03,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7014f98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03, skipping insertion in model container [2022-01-10 08:18:03,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 08:18:03,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 08:18:03,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[913,926] [2022-01-10 08:18:03,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[5977,5990] [2022-01-10 08:18:03,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:18:03,844 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 08:18:03,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[913,926] [2022-01-10 08:18:03,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.03.cil-1.c[5977,5990] [2022-01-10 08:18:03,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:18:03,911 INFO L208 MainTranslator]: Completed translation [2022-01-10 08:18:03,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03 WrapperNode [2022-01-10 08:18:03,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 08:18:03,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 08:18:03,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 08:18:03,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 08:18:03,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,966 INFO L137 Inliner]: procedures = 55, calls = 58, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 514 [2022-01-10 08:18:03,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 08:18:03,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 08:18:03,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 08:18:03,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 08:18:03,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:03,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 08:18:03,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 08:18:03,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 08:18:03,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 08:18:04,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (1/1) ... [2022-01-10 08:18:04,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:18:04,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 08:18:04,041 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 08:18:04,060 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 08:18:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 08:18:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 08:18:04,070 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 08:18:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-01-10 08:18:04,070 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-01-10 08:18:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 08:18:04,071 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 08:18:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 08:18:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 08:18:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 08:18:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 08:18:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 08:18:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 08:18:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 08:18:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 08:18:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 08:18:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 08:18:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 08:18:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 08:18:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 08:18:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 08:18:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 08:18:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-01-10 08:18:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-01-10 08:18:04,181 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 08:18:04,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 08:18:04,550 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 08:18:04,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 08:18:04,557 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-01-10 08:18:04,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:18:04 BoogieIcfgContainer [2022-01-10 08:18:04,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 08:18:04,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 08:18:04,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 08:18:04,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 08:18:04,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:18:03" (1/3) ... [2022-01-10 08:18:04,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3764ddec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:18:04, skipping insertion in model container [2022-01-10 08:18:04,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:18:03" (2/3) ... [2022-01-10 08:18:04,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3764ddec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:18:04, skipping insertion in model container [2022-01-10 08:18:04,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:18:04" (3/3) ... [2022-01-10 08:18:04,569 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.03.cil-1.c [2022-01-10 08:18:04,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 08:18:04,572 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 08:18:04,616 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 08:18:04,622 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 08:18:04,622 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 08:18:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 199 states have (on average 1.592964824120603) internal successors, (317), 206 states have internal predecessors, (317), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-10 08:18:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 08:18:04,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:04,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:04,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1832472135, now seen corresponding path program 1 times [2022-01-10 08:18:04,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:04,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888558396] [2022-01-10 08:18:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:04,662 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:04,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:04,664 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 08:18:04,664 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 08:18:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:04,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:04,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:04,892 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 08:18:04,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:04,893 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:04,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888558396] [2022-01-10 08:18:04,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888558396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:04,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:04,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:04,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809714326] [2022-01-10 08:18:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:04,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:04,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:04,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:04,927 INFO L87 Difference]: Start difference. First operand has 237 states, 199 states have (on average 1.592964824120603) internal successors, (317), 206 states have internal predecessors, (317), 25 states have call successors, (25), 10 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:05,030 INFO L93 Difference]: Finished difference Result 516 states and 804 transitions. [2022-01-10 08:18:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:05,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-01-10 08:18:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:05,046 INFO L225 Difference]: With dead ends: 516 [2022-01-10 08:18:05,046 INFO L226 Difference]: Without dead ends: 285 [2022-01-10 08:18:05,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 08:18:05,053 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 321 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:05,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 441 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-01-10 08:18:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2022-01-10 08:18:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 240 states have (on average 1.4625) internal successors, (351), 244 states have internal predecessors, (351), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2022-01-10 08:18:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 409 transitions. [2022-01-10 08:18:05,114 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 409 transitions. Word has length 44 [2022-01-10 08:18:05,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:05,115 INFO L470 AbstractCegarLoop]: Abstraction has 281 states and 409 transitions. [2022-01-10 08:18:05,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 409 transitions. [2022-01-10 08:18:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 08:18:05,117 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:05,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] [2022-01-10 08:18:05,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 08:18:05,323 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 08:18:05,324 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -882534523, now seen corresponding path program 1 times [2022-01-10 08:18:05,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:05,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659537506] [2022-01-10 08:18:05,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:05,325 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:05,327 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 08:18:05,328 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 08:18:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:05,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:05,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:05,466 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 08:18:05,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:05,466 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:05,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659537506] [2022-01-10 08:18:05,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659537506] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:05,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:05,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:05,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979642775] [2022-01-10 08:18:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:05,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:05,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:05,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:05,482 INFO L87 Difference]: Start difference. First operand 281 states and 409 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:05,517 INFO L93 Difference]: Finished difference Result 489 states and 697 transitions. [2022-01-10 08:18:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:05,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-01-10 08:18:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:05,522 INFO L225 Difference]: With dead ends: 489 [2022-01-10 08:18:05,523 INFO L226 Difference]: Without dead ends: 374 [2022-01-10 08:18:05,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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 08:18:05,525 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 62 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:05,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 664 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-01-10 08:18:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 348. [2022-01-10 08:18:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 301 states have (on average 1.4451827242524917) internal successors, (435), 305 states have internal predecessors, (435), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (33), 28 states have call predecessors, (33), 28 states have call successors, (33) [2022-01-10 08:18:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 500 transitions. [2022-01-10 08:18:05,550 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 500 transitions. Word has length 45 [2022-01-10 08:18:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:05,551 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 500 transitions. [2022-01-10 08:18:05,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 500 transitions. [2022-01-10 08:18:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 08:18:05,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:05,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:05,567 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 08:18:05,763 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 08:18:05,764 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2128075312, now seen corresponding path program 1 times [2022-01-10 08:18:05,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:05,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364233297] [2022-01-10 08:18:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:05,765 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:05,766 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 08:18:05,768 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 08:18:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:05,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:05,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:05,901 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 08:18:05,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:05,901 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:05,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364233297] [2022-01-10 08:18:05,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364233297] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:05,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:05,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:05,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394154863] [2022-01-10 08:18:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:05,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:05,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:05,902 INFO L87 Difference]: Start difference. First operand 348 states and 500 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:05,970 INFO L93 Difference]: Finished difference Result 701 states and 988 transitions. [2022-01-10 08:18:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-01-10 08:18:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:05,974 INFO L225 Difference]: With dead ends: 701 [2022-01-10 08:18:05,974 INFO L226 Difference]: Without dead ends: 519 [2022-01-10 08:18:05,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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 08:18:05,977 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 301 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 421 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 08:18:05,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 421 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-10 08:18:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 505. [2022-01-10 08:18:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 440 states have (on average 1.4022727272727273) internal successors, (617), 446 states have internal predecessors, (617), 43 states have call successors, (43), 22 states have call predecessors, (43), 20 states have return successors, (49), 37 states have call predecessors, (49), 39 states have call successors, (49) [2022-01-10 08:18:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 709 transitions. [2022-01-10 08:18:06,008 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 709 transitions. Word has length 45 [2022-01-10 08:18:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:06,008 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 709 transitions. [2022-01-10 08:18:06,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 08:18:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 709 transitions. [2022-01-10 08:18:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 08:18:06,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:06,011 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:06,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:06,220 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 08:18:06,222 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:06,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash 888089079, now seen corresponding path program 1 times [2022-01-10 08:18:06,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:06,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136555397] [2022-01-10 08:18:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:06,223 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:06,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:06,224 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 08:18:06,226 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 08:18:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:06,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:06,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:06,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:06,400 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:06,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136555397] [2022-01-10 08:18:06,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136555397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:06,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:06,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:06,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868616452] [2022-01-10 08:18:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:06,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:06,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:06,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:06,404 INFO L87 Difference]: Start difference. First operand 505 states and 709 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:06,441 INFO L93 Difference]: Finished difference Result 1017 states and 1406 transitions. [2022-01-10 08:18:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-01-10 08:18:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:06,445 INFO L225 Difference]: With dead ends: 1017 [2022-01-10 08:18:06,445 INFO L226 Difference]: Without dead ends: 678 [2022-01-10 08:18:06,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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 08:18:06,449 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 50 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:06,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 710 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-01-10 08:18:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2022-01-10 08:18:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 591 states have (on average 1.350253807106599) internal successors, (798), 597 states have internal predecessors, (798), 57 states have call successors, (57), 30 states have call predecessors, (57), 28 states have return successors, (71), 51 states have call predecessors, (71), 53 states have call successors, (71) [2022-01-10 08:18:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 926 transitions. [2022-01-10 08:18:06,480 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 926 transitions. Word has length 62 [2022-01-10 08:18:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:06,482 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 926 transitions. [2022-01-10 08:18:06,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 926 transitions. [2022-01-10 08:18:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 08:18:06,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:06,489 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:06,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 08:18:06,695 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 08:18:06,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 306547218, now seen corresponding path program 1 times [2022-01-10 08:18:06,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:06,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125751563] [2022-01-10 08:18:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:06,696 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:06,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:06,697 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 08:18:06,699 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 08:18:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:06,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:06,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 08:18:06,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:06,864 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:06,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125751563] [2022-01-10 08:18:06,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125751563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:06,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:06,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:06,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486701262] [2022-01-10 08:18:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:06,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:06,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:06,866 INFO L87 Difference]: Start difference. First operand 678 states and 926 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:06,902 INFO L93 Difference]: Finished difference Result 1225 states and 1647 transitions. [2022-01-10 08:18:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:06,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-01-10 08:18:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:06,908 INFO L225 Difference]: With dead ends: 1225 [2022-01-10 08:18:06,908 INFO L226 Difference]: Without dead ends: 805 [2022-01-10 08:18:06,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 08:18:06,910 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 288 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 416 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 08:18:06,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 416 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-01-10 08:18:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2022-01-10 08:18:06,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 704 states have (on average 1.3210227272727273) internal successors, (930), 710 states have internal predecessors, (930), 65 states have call successors, (65), 36 states have call predecessors, (65), 34 states have return successors, (83), 59 states have call predecessors, (83), 61 states have call successors, (83) [2022-01-10 08:18:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1078 transitions. [2022-01-10 08:18:06,941 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1078 transitions. Word has length 67 [2022-01-10 08:18:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:06,941 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1078 transitions. [2022-01-10 08:18:06,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1078 transitions. [2022-01-10 08:18:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 08:18:06,942 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:06,942 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:06,951 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 08:18:07,160 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 08:18:07,161 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1645428910, now seen corresponding path program 1 times [2022-01-10 08:18:07,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:07,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504885282] [2022-01-10 08:18:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:07,162 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:07,163 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 08:18:07,164 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 08:18:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:07,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:07,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 08:18:07,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:07,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:07,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504885282] [2022-01-10 08:18:07,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504885282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:07,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:07,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:07,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053292392] [2022-01-10 08:18:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:07,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:07,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:07,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:07,312 INFO L87 Difference]: Start difference. First operand 805 states and 1078 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:07,356 INFO L93 Difference]: Finished difference Result 1442 states and 1923 transitions. [2022-01-10 08:18:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2022-01-10 08:18:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:07,361 INFO L225 Difference]: With dead ends: 1442 [2022-01-10 08:18:07,361 INFO L226 Difference]: Without dead ends: 948 [2022-01-10 08:18:07,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 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 08:18:07,363 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 50 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1339 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 08:18:07,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 1339 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-01-10 08:18:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 846. [2022-01-10 08:18:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 743 states have (on average 1.304172274562584) internal successors, (969), 751 states have internal predecessors, (969), 65 states have call successors, (65), 36 states have call predecessors, (65), 36 states have return successors, (85), 59 states have call predecessors, (85), 61 states have call successors, (85) [2022-01-10 08:18:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1119 transitions. [2022-01-10 08:18:07,395 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1119 transitions. Word has length 68 [2022-01-10 08:18:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:07,396 INFO L470 AbstractCegarLoop]: Abstraction has 846 states and 1119 transitions. [2022-01-10 08:18:07,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1119 transitions. [2022-01-10 08:18:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 08:18:07,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:07,397 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:07,409 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 08:18:07,604 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 08:18:07,605 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:07,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1620179088, now seen corresponding path program 1 times [2022-01-10 08:18:07,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:07,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524179228] [2022-01-10 08:18:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:07,606 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:07,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:07,607 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 08:18:07,609 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 08:18:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:07,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:07,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 08:18:07,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:07,772 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:07,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524179228] [2022-01-10 08:18:07,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524179228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:07,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:07,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:07,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004872057] [2022-01-10 08:18:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:07,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:07,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:07,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:07,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:07,773 INFO L87 Difference]: Start difference. First operand 846 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:07,812 INFO L93 Difference]: Finished difference Result 1339 states and 1765 transitions. [2022-01-10 08:18:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:07,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2022-01-10 08:18:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:07,815 INFO L225 Difference]: With dead ends: 1339 [2022-01-10 08:18:07,815 INFO L226 Difference]: Without dead ends: 757 [2022-01-10 08:18:07,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 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 08:18:07,817 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 10 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1311 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 08:18:07,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-01-10 08:18:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 737. [2022-01-10 08:18:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 648 states have (on average 1.3024691358024691) internal successors, (844), 658 states have internal predecessors, (844), 55 states have call successors, (55), 30 states have call predecessors, (55), 32 states have return successors, (71), 49 states have call predecessors, (71), 51 states have call successors, (71) [2022-01-10 08:18:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 970 transitions. [2022-01-10 08:18:07,840 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 970 transitions. Word has length 68 [2022-01-10 08:18:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:07,840 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 970 transitions. [2022-01-10 08:18:07,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 08:18:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 970 transitions. [2022-01-10 08:18:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 08:18:07,841 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:07,841 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:07,865 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 08:18:08,051 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 08:18:08,052 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash -625021232, now seen corresponding path program 1 times [2022-01-10 08:18:08,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:08,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899096022] [2022-01-10 08:18:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:08,052 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:08,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:08,053 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 08:18:08,054 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 08:18:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:08,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:08,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:08,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:18:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 08:18:08,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:08,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899096022] [2022-01-10 08:18:08,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899096022] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 08:18:08,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 08:18:08,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-01-10 08:18:08,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752115772] [2022-01-10 08:18:08,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:08,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:08,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:08,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:08,316 INFO L87 Difference]: Start difference. First operand 737 states and 970 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:08,407 INFO L93 Difference]: Finished difference Result 792 states and 1037 transitions. [2022-01-10 08:18:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:18:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-01-10 08:18:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:08,411 INFO L225 Difference]: With dead ends: 792 [2022-01-10 08:18:08,411 INFO L226 Difference]: Without dead ends: 789 [2022-01-10 08:18:08,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 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 08:18:08,412 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 576 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:08,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 421 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-01-10 08:18:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 736. [2022-01-10 08:18:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 648 states have (on average 1.2993827160493827) internal successors, (842), 657 states have internal predecessors, (842), 54 states have call successors, (54), 30 states have call predecessors, (54), 32 states have return successors, (71), 49 states have call predecessors, (71), 51 states have call successors, (71) [2022-01-10 08:18:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 967 transitions. [2022-01-10 08:18:08,434 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 967 transitions. Word has length 68 [2022-01-10 08:18:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:08,434 INFO L470 AbstractCegarLoop]: Abstraction has 736 states and 967 transitions. [2022-01-10 08:18:08,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 08:18:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 967 transitions. [2022-01-10 08:18:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 08:18:08,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:08,437 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 08:18:08,447 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 08:18:08,647 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 08:18:08,648 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:08,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2098417751, now seen corresponding path program 1 times [2022-01-10 08:18:08,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:08,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702886527] [2022-01-10 08:18:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:08,649 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:08,650 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 08:18:08,650 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 08:18:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:08,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:18:08,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:18:08,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:18:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 08:18:09,124 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702886527] [2022-01-10 08:18:09,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702886527] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 08:18:09,125 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 08:18:09,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2022-01-10 08:18:09,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570854234] [2022-01-10 08:18:09,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 08:18:09,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 08:18:09,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 08:18:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:09,126 INFO L87 Difference]: Start difference. First operand 736 states and 967 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 08:18:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:09,312 INFO L93 Difference]: Finished difference Result 1559 states and 2009 transitions. [2022-01-10 08:18:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 08:18:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2022-01-10 08:18:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:09,317 INFO L225 Difference]: With dead ends: 1559 [2022-01-10 08:18:09,317 INFO L226 Difference]: Without dead ends: 1556 [2022-01-10 08:18:09,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:18:09,317 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 791 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:09,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 1242 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-01-10 08:18:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1085. [2022-01-10 08:18:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 961 states have (on average 1.2840790842872007) internal successors, (1234), 976 states have internal predecessors, (1234), 73 states have call successors, (73), 43 states have call predecessors, (73), 49 states have return successors, (102), 66 states have call predecessors, (102), 70 states have call successors, (102) [2022-01-10 08:18:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1409 transitions. [2022-01-10 08:18:09,351 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1409 transitions. Word has length 69 [2022-01-10 08:18:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:09,351 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1409 transitions. [2022-01-10 08:18:09,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 08:18:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1409 transitions. [2022-01-10 08:18:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:09,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:09,353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:09,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-01-10 08:18:09,561 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 08:18:09,561 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:09,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1086322536, now seen corresponding path program 1 times [2022-01-10 08:18:09,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:09,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21896119] [2022-01-10 08:18:09,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:09,562 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:09,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:09,563 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 08:18:09,565 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 08:18:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:09,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:09,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:09,751 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 08:18:09,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:09,752 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:09,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21896119] [2022-01-10 08:18:09,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21896119] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:09,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:09,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:09,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392918676] [2022-01-10 08:18:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:09,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:09,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:09,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:09,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:09,753 INFO L87 Difference]: Start difference. First operand 1085 states and 1409 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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 08:18:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:10,069 INFO L93 Difference]: Finished difference Result 1393 states and 1877 transitions. [2022-01-10 08:18:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:10,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:10,074 INFO L225 Difference]: With dead ends: 1393 [2022-01-10 08:18:10,074 INFO L226 Difference]: Without dead ends: 1245 [2022-01-10 08:18:10,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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 08:18:10,075 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 512 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:10,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 898 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 08:18:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2022-01-10 08:18:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1232. [2022-01-10 08:18:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1089 states have (on average 1.3140495867768596) internal successors, (1431), 1105 states have internal predecessors, (1431), 85 states have call successors, (85), 49 states have call predecessors, (85), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2022-01-10 08:18:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1631 transitions. [2022-01-10 08:18:10,134 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1631 transitions. Word has length 80 [2022-01-10 08:18:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:10,134 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 1631 transitions. [2022-01-10 08:18:10,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 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 08:18:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1631 transitions. [2022-01-10 08:18:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:10,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:10,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:10,145 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 08:18:10,342 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 08:18:10,343 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1967204244, now seen corresponding path program 1 times [2022-01-10 08:18:10,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:10,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644464405] [2022-01-10 08:18:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:10,344 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:10,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:10,345 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 08:18:10,345 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 08:18:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:10,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:10,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:10,507 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 08:18:10,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:10,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:10,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644464405] [2022-01-10 08:18:10,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644464405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:10,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:10,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:10,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393136291] [2022-01-10 08:18:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:10,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:10,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:10,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:10,508 INFO L87 Difference]: Start difference. First operand 1232 states and 1631 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:10,696 INFO L93 Difference]: Finished difference Result 1527 states and 2081 transitions. [2022-01-10 08:18:10,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:18:10,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:10,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:10,700 INFO L225 Difference]: With dead ends: 1527 [2022-01-10 08:18:10,700 INFO L226 Difference]: Without dead ends: 1232 [2022-01-10 08:18:10,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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 08:18:10,701 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 406 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:10,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 656 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-01-10 08:18:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2022-01-10 08:18:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1089 states have (on average 1.3076216712580349) internal successors, (1424), 1105 states have internal predecessors, (1424), 85 states have call successors, (85), 49 states have call predecessors, (85), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2022-01-10 08:18:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1624 transitions. [2022-01-10 08:18:10,744 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1624 transitions. Word has length 80 [2022-01-10 08:18:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:10,744 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 1624 transitions. [2022-01-10 08:18:10,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1624 transitions. [2022-01-10 08:18:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:10,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:10,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:10,761 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 08:18:10,952 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 08:18:10,953 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2090714856, now seen corresponding path program 1 times [2022-01-10 08:18:10,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:10,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992392263] [2022-01-10 08:18:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:10,954 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:10,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:10,954 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 08:18:10,955 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 08:18:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:11,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:11,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:11,129 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 08:18:11,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:11,129 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:11,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992392263] [2022-01-10 08:18:11,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992392263] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:11,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:11,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:11,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892034349] [2022-01-10 08:18:11,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:11,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:11,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:11,130 INFO L87 Difference]: Start difference. First operand 1232 states and 1624 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:11,370 INFO L93 Difference]: Finished difference Result 1527 states and 2067 transitions. [2022-01-10 08:18:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:18:11,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:11,374 INFO L225 Difference]: With dead ends: 1527 [2022-01-10 08:18:11,374 INFO L226 Difference]: Without dead ends: 1232 [2022-01-10 08:18:11,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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 08:18:11,376 INFO L933 BasicCegarLoop]: 298 mSDtfsCounter, 400 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:11,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 649 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-01-10 08:18:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2022-01-10 08:18:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1089 states have (on average 1.3011937557392104) internal successors, (1417), 1105 states have internal predecessors, (1417), 85 states have call successors, (85), 49 states have call predecessors, (85), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2022-01-10 08:18:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1617 transitions. [2022-01-10 08:18:11,421 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1617 transitions. Word has length 80 [2022-01-10 08:18:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:11,421 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 1617 transitions. [2022-01-10 08:18:11,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1617 transitions. [2022-01-10 08:18:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:11,423 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:11,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:11,430 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 08:18:11,630 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 08:18:11,630 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2083068140, now seen corresponding path program 1 times [2022-01-10 08:18:11,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:11,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350140666] [2022-01-10 08:18:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:11,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:11,632 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 08:18:11,633 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 08:18:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:11,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:11,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:11,804 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 08:18:11,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:11,805 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350140666] [2022-01-10 08:18:11,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350140666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:11,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:11,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:11,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465554793] [2022-01-10 08:18:11,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:11,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:11,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:11,806 INFO L87 Difference]: Start difference. First operand 1232 states and 1617 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:11,999 INFO L93 Difference]: Finished difference Result 1527 states and 2053 transitions. [2022-01-10 08:18:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:18:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:12,003 INFO L225 Difference]: With dead ends: 1527 [2022-01-10 08:18:12,003 INFO L226 Difference]: Without dead ends: 1232 [2022-01-10 08:18:12,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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 08:18:12,004 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 394 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:12,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 642 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-01-10 08:18:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2022-01-10 08:18:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1089 states have (on average 1.2947658402203857) internal successors, (1410), 1105 states have internal predecessors, (1410), 85 states have call successors, (85), 49 states have call predecessors, (85), 56 states have return successors, (115), 78 states have call predecessors, (115), 82 states have call successors, (115) [2022-01-10 08:18:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1610 transitions. [2022-01-10 08:18:12,043 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1610 transitions. Word has length 80 [2022-01-10 08:18:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:12,044 INFO L470 AbstractCegarLoop]: Abstraction has 1232 states and 1610 transitions. [2022-01-10 08:18:12,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1610 transitions. [2022-01-10 08:18:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:12,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:12,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:12,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:12,260 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 08:18:12,261 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1935051160, now seen corresponding path program 1 times [2022-01-10 08:18:12,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:12,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382838191] [2022-01-10 08:18:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:12,261 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:12,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:12,262 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 08:18:12,263 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 08:18:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:12,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:12,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:12,416 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 08:18:12,416 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:12,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:12,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382838191] [2022-01-10 08:18:12,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382838191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:12,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:12,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:12,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212480742] [2022-01-10 08:18:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:12,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:12,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:12,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:12,418 INFO L87 Difference]: Start difference. First operand 1232 states and 1610 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:12,644 INFO L93 Difference]: Finished difference Result 1593 states and 2139 transitions. [2022-01-10 08:18:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:12,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:12,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:12,648 INFO L225 Difference]: With dead ends: 1593 [2022-01-10 08:18:12,648 INFO L226 Difference]: Without dead ends: 1298 [2022-01-10 08:18:12,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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 08:18:12,649 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 424 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:12,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [439 Valid, 634 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-01-10 08:18:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2022-01-10 08:18:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1149 states have (on average 1.2924281984334203) internal successors, (1485), 1165 states have internal predecessors, (1485), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (117), 80 states have call predecessors, (117), 84 states have call successors, (117) [2022-01-10 08:18:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1689 transitions. [2022-01-10 08:18:12,695 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1689 transitions. Word has length 80 [2022-01-10 08:18:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:12,695 INFO L470 AbstractCegarLoop]: Abstraction has 1298 states and 1689 transitions. [2022-01-10 08:18:12,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1689 transitions. [2022-01-10 08:18:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:12,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:12,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:12,705 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 08:18:12,905 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 08:18:12,906 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1577842635, now seen corresponding path program 1 times [2022-01-10 08:18:12,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:12,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081569171] [2022-01-10 08:18:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:12,906 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:12,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:12,907 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 08:18:12,908 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 08:18:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:12,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:12,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:13,079 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 08:18:13,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:13,079 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:13,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081569171] [2022-01-10 08:18:13,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081569171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:13,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:13,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:13,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792430314] [2022-01-10 08:18:13,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:13,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:13,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:13,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:13,080 INFO L87 Difference]: Start difference. First operand 1298 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:13,343 INFO L93 Difference]: Finished difference Result 1725 states and 2297 transitions. [2022-01-10 08:18:13,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:13,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:13,348 INFO L225 Difference]: With dead ends: 1725 [2022-01-10 08:18:13,348 INFO L226 Difference]: Without dead ends: 1364 [2022-01-10 08:18:13,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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 08:18:13,350 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 416 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:13,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 627 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-01-10 08:18:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2022-01-10 08:18:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1209 states have (on average 1.2870140612076095) internal successors, (1556), 1225 states have internal predecessors, (1556), 89 states have call successors, (89), 57 states have call predecessors, (89), 64 states have return successors, (119), 82 states have call predecessors, (119), 86 states have call successors, (119) [2022-01-10 08:18:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1764 transitions. [2022-01-10 08:18:13,409 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1764 transitions. Word has length 80 [2022-01-10 08:18:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:13,410 INFO L470 AbstractCegarLoop]: Abstraction has 1364 states and 1764 transitions. [2022-01-10 08:18:13,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1764 transitions. [2022-01-10 08:18:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:13,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:13,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:13,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-01-10 08:18:13,618 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 08:18:13,618 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:13,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash 982288912, now seen corresponding path program 1 times [2022-01-10 08:18:13,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:13,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924490656] [2022-01-10 08:18:13,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:13,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:13,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:13,620 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 08:18:13,620 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 08:18:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:13,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:13,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:13,789 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 08:18:13,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:13,790 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:13,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924490656] [2022-01-10 08:18:13,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924490656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:13,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:13,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:13,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736957104] [2022-01-10 08:18:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:13,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:13,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:13,791 INFO L87 Difference]: Start difference. First operand 1364 states and 1764 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:14,058 INFO L93 Difference]: Finished difference Result 1857 states and 2447 transitions. [2022-01-10 08:18:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:14,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:14,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:14,063 INFO L225 Difference]: With dead ends: 1857 [2022-01-10 08:18:14,063 INFO L226 Difference]: Without dead ends: 1430 [2022-01-10 08:18:14,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 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 08:18:14,065 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 410 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:14,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 619 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-01-10 08:18:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2022-01-10 08:18:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1269 states have (on average 1.2789598108747045) internal successors, (1623), 1285 states have internal predecessors, (1623), 91 states have call successors, (91), 61 states have call predecessors, (91), 68 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2022-01-10 08:18:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1835 transitions. [2022-01-10 08:18:14,142 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 1835 transitions. Word has length 80 [2022-01-10 08:18:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:14,142 INFO L470 AbstractCegarLoop]: Abstraction has 1430 states and 1835 transitions. [2022-01-10 08:18:14,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 08:18:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 1835 transitions. [2022-01-10 08:18:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:14,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:14,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:14,153 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 08:18:14,350 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 08:18:14,351 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1965690516, now seen corresponding path program 1 times [2022-01-10 08:18:14,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:14,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827603966] [2022-01-10 08:18:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:14,351 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:14,352 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 08:18:14,353 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 08:18:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:14,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:14,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:14,490 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 08:18:14,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:14,490 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:14,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827603966] [2022-01-10 08:18:14,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827603966] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:14,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:14,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:14,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094738184] [2022-01-10 08:18:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:14,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:14,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:14,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:14,491 INFO L87 Difference]: Start difference. First operand 1430 states and 1835 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:14,553 INFO L93 Difference]: Finished difference Result 2020 states and 2628 transitions. [2022-01-10 08:18:14,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:14,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 08:18:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:14,558 INFO L225 Difference]: With dead ends: 2020 [2022-01-10 08:18:14,558 INFO L226 Difference]: Without dead ends: 1528 [2022-01-10 08:18:14,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 08:18:14,561 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 128 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1277 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 08:18:14,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 1277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2022-01-10 08:18:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1436. [2022-01-10 08:18:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1275 states have (on average 1.2729411764705882) internal successors, (1623), 1291 states have internal predecessors, (1623), 91 states have call successors, (91), 61 states have call predecessors, (91), 68 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2022-01-10 08:18:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1835 transitions. [2022-01-10 08:18:14,624 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1835 transitions. Word has length 80 [2022-01-10 08:18:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:14,625 INFO L470 AbstractCegarLoop]: Abstraction has 1436 states and 1835 transitions. [2022-01-10 08:18:14,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1835 transitions. [2022-01-10 08:18:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:14,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:14,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:14,637 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 08:18:14,837 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 08:18:14,838 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1484610258, now seen corresponding path program 1 times [2022-01-10 08:18:14,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:14,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646750017] [2022-01-10 08:18:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:14,838 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:14,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:14,839 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 08:18:14,840 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 08:18:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:14,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:14,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:14,981 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 08:18:14,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:14,981 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:14,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646750017] [2022-01-10 08:18:14,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646750017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:14,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:14,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:14,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243065436] [2022-01-10 08:18:14,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:14,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:14,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:14,990 INFO L87 Difference]: Start difference. First operand 1436 states and 1835 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:15,060 INFO L93 Difference]: Finished difference Result 2214 states and 2868 transitions. [2022-01-10 08:18:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:15,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 08:18:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:15,065 INFO L225 Difference]: With dead ends: 2214 [2022-01-10 08:18:15,066 INFO L226 Difference]: Without dead ends: 1716 [2022-01-10 08:18:15,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 08:18:15,067 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 90 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1267 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 08:18:15,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 1267 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-01-10 08:18:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1460. [2022-01-10 08:18:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1299 states have (on average 1.2678983833718245) internal successors, (1647), 1315 states have internal predecessors, (1647), 91 states have call successors, (91), 61 states have call predecessors, (91), 68 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2022-01-10 08:18:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1859 transitions. [2022-01-10 08:18:15,128 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1859 transitions. Word has length 80 [2022-01-10 08:18:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:15,128 INFO L470 AbstractCegarLoop]: Abstraction has 1460 states and 1859 transitions. [2022-01-10 08:18:15,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1859 transitions. [2022-01-10 08:18:15,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:15,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:15,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:15,137 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 08:18:15,337 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 08:18:15,337 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -564777584, now seen corresponding path program 1 times [2022-01-10 08:18:15,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:15,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160326560] [2022-01-10 08:18:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:15,338 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:15,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:15,339 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 08:18:15,371 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 08:18:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:15,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:15,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:15,473 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 08:18:15,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:15,474 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:15,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160326560] [2022-01-10 08:18:15,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160326560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:15,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:15,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:15,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918381116] [2022-01-10 08:18:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:15,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:15,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:15,475 INFO L87 Difference]: Start difference. First operand 1460 states and 1859 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:15,544 INFO L93 Difference]: Finished difference Result 2024 states and 2600 transitions. [2022-01-10 08:18:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:15,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 08:18:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:15,548 INFO L225 Difference]: With dead ends: 2024 [2022-01-10 08:18:15,549 INFO L226 Difference]: Without dead ends: 1502 [2022-01-10 08:18:15,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 08:18:15,550 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 49 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1250 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 08:18:15,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1250 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-01-10 08:18:15,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1466. [2022-01-10 08:18:15,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1305 states have (on average 1.2620689655172415) internal successors, (1647), 1321 states have internal predecessors, (1647), 91 states have call successors, (91), 61 states have call predecessors, (91), 68 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2022-01-10 08:18:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1859 transitions. [2022-01-10 08:18:15,604 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1859 transitions. Word has length 80 [2022-01-10 08:18:15,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:15,604 INFO L470 AbstractCegarLoop]: Abstraction has 1466 states and 1859 transitions. [2022-01-10 08:18:15,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1859 transitions. [2022-01-10 08:18:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:15,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:15,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:15,614 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 08:18:15,812 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 08:18:15,812 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1594136882, now seen corresponding path program 1 times [2022-01-10 08:18:15,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:15,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427354704] [2022-01-10 08:18:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:15,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:15,814 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 08:18:15,824 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 08:18:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:15,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:15,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:15,972 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 08:18:15,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:15,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:15,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427354704] [2022-01-10 08:18:15,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427354704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:15,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:15,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:18:15,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917650832] [2022-01-10 08:18:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:15,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:15,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:15,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:15,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:15,974 INFO L87 Difference]: Start difference. First operand 1466 states and 1859 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:16,035 INFO L93 Difference]: Finished difference Result 2008 states and 2564 transitions. [2022-01-10 08:18:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:16,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 08:18:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:16,039 INFO L225 Difference]: With dead ends: 2008 [2022-01-10 08:18:16,039 INFO L226 Difference]: Without dead ends: 1480 [2022-01-10 08:18:16,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 08:18:16,041 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 10 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1227 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 08:18:16,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1227 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2022-01-10 08:18:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1472. [2022-01-10 08:18:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1311 states have (on average 1.2562929061784898) internal successors, (1647), 1327 states have internal predecessors, (1647), 91 states have call successors, (91), 61 states have call predecessors, (91), 68 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2022-01-10 08:18:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 1859 transitions. [2022-01-10 08:18:16,102 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 1859 transitions. Word has length 80 [2022-01-10 08:18:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:16,102 INFO L470 AbstractCegarLoop]: Abstraction has 1472 states and 1859 transitions. [2022-01-10 08:18:16,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1859 transitions. [2022-01-10 08:18:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:16,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:16,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:16,112 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 08:18:16,310 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 08:18:16,310 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:16,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1319377268, now seen corresponding path program 1 times [2022-01-10 08:18:16,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:16,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420746300] [2022-01-10 08:18:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:16,311 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:16,312 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 08:18:16,312 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 08:18:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:16,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 08:18:16,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:16,495 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 08:18:16,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:16,495 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:16,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420746300] [2022-01-10 08:18:16,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420746300] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:16,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:16,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:16,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881385819] [2022-01-10 08:18:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:16,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:18:16,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:18:16,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:18:16,496 INFO L87 Difference]: Start difference. First operand 1472 states and 1859 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:16,784 INFO L93 Difference]: Finished difference Result 2085 states and 2637 transitions. [2022-01-10 08:18:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:16,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2022-01-10 08:18:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:16,790 INFO L225 Difference]: With dead ends: 2085 [2022-01-10 08:18:16,791 INFO L226 Difference]: Without dead ends: 1550 [2022-01-10 08:18:16,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 08:18:16,793 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 387 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:16,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 636 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-01-10 08:18:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1514. [2022-01-10 08:18:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1351 states have (on average 1.2405625462620282) internal successors, (1676), 1367 states have internal predecessors, (1676), 91 states have call successors, (91), 63 states have call predecessors, (91), 70 states have return successors, (121), 84 states have call predecessors, (121), 88 states have call successors, (121) [2022-01-10 08:18:16,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 1888 transitions. [2022-01-10 08:18:16,895 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 1888 transitions. Word has length 80 [2022-01-10 08:18:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:16,896 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 1888 transitions. [2022-01-10 08:18:16,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:18:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1888 transitions. [2022-01-10 08:18:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-10 08:18:16,900 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:16,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:16,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-01-10 08:18:17,106 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 08:18:17,106 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1170151694, now seen corresponding path program 1 times [2022-01-10 08:18:17,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:17,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052296044] [2022-01-10 08:18:17,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:17,107 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:17,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:17,108 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 08:18:17,108 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 08:18:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:17,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:17,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:17,272 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 08:18:17,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:17,272 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:17,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052296044] [2022-01-10 08:18:17,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052296044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:17,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:17,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:18:17,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960541095] [2022-01-10 08:18:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:17,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:17,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:17,273 INFO L87 Difference]: Start difference. First operand 1514 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 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 08:18:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:17,347 INFO L93 Difference]: Finished difference Result 2629 states and 3249 transitions. [2022-01-10 08:18:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:17,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 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 80 [2022-01-10 08:18:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:17,354 INFO L225 Difference]: With dead ends: 2629 [2022-01-10 08:18:17,354 INFO L226 Difference]: Without dead ends: 2053 [2022-01-10 08:18:17,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 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 08:18:17,356 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 208 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 538 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 08:18:17,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 538 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2022-01-10 08:18:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2051. [2022-01-10 08:18:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1830 states have (on average 1.2251366120218579) internal successors, (2242), 1849 states have internal predecessors, (2242), 122 states have call successors, (122), 89 states have call predecessors, (122), 97 states have return successors, (153), 113 states have call predecessors, (153), 119 states have call successors, (153) [2022-01-10 08:18:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2517 transitions. [2022-01-10 08:18:17,445 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2517 transitions. Word has length 80 [2022-01-10 08:18:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:17,446 INFO L470 AbstractCegarLoop]: Abstraction has 2051 states and 2517 transitions. [2022-01-10 08:18:17,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 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 08:18:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2517 transitions. [2022-01-10 08:18:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-10 08:18:17,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:17,449 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:17,456 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 08:18:17,656 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 08:18:17,656 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1393538441, now seen corresponding path program 2 times [2022-01-10 08:18:17,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:17,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280474114] [2022-01-10 08:18:17,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 08:18:17,657 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:17,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:17,657 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 08:18:17,659 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 08:18:17,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 08:18:17,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 08:18:17,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:17,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 08:18:17,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:17,821 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280474114] [2022-01-10 08:18:17,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280474114] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:17,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:17,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:17,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022027626] [2022-01-10 08:18:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:17,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:17,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:17,822 INFO L87 Difference]: Start difference. First operand 2051 states and 2517 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 08:18:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:17,895 INFO L93 Difference]: Finished difference Result 2692 states and 3334 transitions. [2022-01-10 08:18:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-01-10 08:18:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:17,900 INFO L225 Difference]: With dead ends: 2692 [2022-01-10 08:18:17,901 INFO L226 Difference]: Without dead ends: 1941 [2022-01-10 08:18:17,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 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 08:18:17,903 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 270 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:17,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 414 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2022-01-10 08:18:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1929. [2022-01-10 08:18:17,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1721 states have (on average 1.220220801859384) internal successors, (2100), 1740 states have internal predecessors, (2100), 115 states have call successors, (115), 84 states have call predecessors, (115), 91 states have return successors, (142), 105 states have call predecessors, (142), 112 states have call successors, (142) [2022-01-10 08:18:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2357 transitions. [2022-01-10 08:18:17,985 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2357 transitions. Word has length 88 [2022-01-10 08:18:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:17,985 INFO L470 AbstractCegarLoop]: Abstraction has 1929 states and 2357 transitions. [2022-01-10 08:18:17,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 08:18:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2357 transitions. [2022-01-10 08:18:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 08:18:17,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:17,987 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 08:18:17,999 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 08:18:18,195 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 08:18:18,195 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -704071169, now seen corresponding path program 1 times [2022-01-10 08:18:18,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:18,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035916492] [2022-01-10 08:18:18,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:18,196 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:18,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:18,197 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 08:18:18,198 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 08:18:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:18,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:18,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 08:18:18,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:18,364 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:18,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035916492] [2022-01-10 08:18:18,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035916492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:18,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:18,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:18,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30581757] [2022-01-10 08:18:18,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:18,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:18,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:18,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:18,366 INFO L87 Difference]: Start difference. First operand 1929 states and 2357 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 08:18:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:18,521 INFO L93 Difference]: Finished difference Result 2759 states and 3404 transitions. [2022-01-10 08:18:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:18,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 103 [2022-01-10 08:18:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:18,526 INFO L225 Difference]: With dead ends: 2759 [2022-01-10 08:18:18,526 INFO L226 Difference]: Without dead ends: 1962 [2022-01-10 08:18:18,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 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 08:18:18,528 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 347 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:18,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 528 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-01-10 08:18:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1929. [2022-01-10 08:18:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1721 states have (on average 1.2115049389889598) internal successors, (2085), 1740 states have internal predecessors, (2085), 115 states have call successors, (115), 84 states have call predecessors, (115), 91 states have return successors, (141), 105 states have call predecessors, (141), 112 states have call successors, (141) [2022-01-10 08:18:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2341 transitions. [2022-01-10 08:18:18,643 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2341 transitions. Word has length 103 [2022-01-10 08:18:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:18,643 INFO L470 AbstractCegarLoop]: Abstraction has 1929 states and 2341 transitions. [2022-01-10 08:18:18,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 08:18:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2341 transitions. [2022-01-10 08:18:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 08:18:18,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:18,645 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 08:18:18,652 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 08:18:18,852 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 08:18:18,852 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1958081778, now seen corresponding path program 1 times [2022-01-10 08:18:18,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:18,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440062226] [2022-01-10 08:18:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:18,853 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:18,854 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 08:18:18,855 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 08:18:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:18,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:18,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 08:18:19,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:19,032 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:19,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440062226] [2022-01-10 08:18:19,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440062226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:19,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:19,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:19,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982985915] [2022-01-10 08:18:19,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:19,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:19,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:19,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:19,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:19,033 INFO L87 Difference]: Start difference. First operand 1929 states and 2341 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 08:18:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:19,119 INFO L93 Difference]: Finished difference Result 2253 states and 2733 transitions. [2022-01-10 08:18:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 104 [2022-01-10 08:18:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:19,124 INFO L225 Difference]: With dead ends: 2253 [2022-01-10 08:18:19,124 INFO L226 Difference]: Without dead ends: 1126 [2022-01-10 08:18:19,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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 08:18:19,127 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 60 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 637 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 08:18:19,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 637 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2022-01-10 08:18:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2022-01-10 08:18:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1003 states have (on average 1.2073778664007977) internal successors, (1211), 1009 states have internal predecessors, (1211), 68 states have call successors, (68), 53 states have call predecessors, (68), 54 states have return successors, (68), 64 states have call predecessors, (68), 66 states have call successors, (68) [2022-01-10 08:18:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1347 transitions. [2022-01-10 08:18:19,184 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1347 transitions. Word has length 104 [2022-01-10 08:18:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:19,184 INFO L470 AbstractCegarLoop]: Abstraction has 1126 states and 1347 transitions. [2022-01-10 08:18:19,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 08:18:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1347 transitions. [2022-01-10 08:18:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-10 08:18:19,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:19,186 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, 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 08:18:19,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-01-10 08:18:19,392 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 08:18:19,393 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:19,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1112724553, now seen corresponding path program 1 times [2022-01-10 08:18:19,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:19,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183483304] [2022-01-10 08:18:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:19,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:19,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:19,394 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 08:18:19,395 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 08:18:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:19,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 08:18:19,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:18:19,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:19,661 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:19,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183483304] [2022-01-10 08:18:19,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183483304] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:19,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:19,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:19,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323448463] [2022-01-10 08:18:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:19,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:19,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:19,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:19,662 INFO L87 Difference]: Start difference. First operand 1126 states and 1347 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 08:18:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:19,864 INFO L93 Difference]: Finished difference Result 3242 states and 3884 transitions. [2022-01-10 08:18:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:19,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 129 [2022-01-10 08:18:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:19,869 INFO L225 Difference]: With dead ends: 3242 [2022-01-10 08:18:19,869 INFO L226 Difference]: Without dead ends: 2130 [2022-01-10 08:18:19,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 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 08:18:19,871 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 239 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:19,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 632 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:19,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2022-01-10 08:18:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2126. [2022-01-10 08:18:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 1892 states have (on average 1.1966173361522199) internal successors, (2264), 1907 states have internal predecessors, (2264), 125 states have call successors, (125), 97 states have call predecessors, (125), 108 states have return successors, (147), 123 states have call predecessors, (147), 123 states have call successors, (147) [2022-01-10 08:18:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 2536 transitions. [2022-01-10 08:18:19,976 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 2536 transitions. Word has length 129 [2022-01-10 08:18:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:19,977 INFO L470 AbstractCegarLoop]: Abstraction has 2126 states and 2536 transitions. [2022-01-10 08:18:19,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 08:18:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2536 transitions. [2022-01-10 08:18:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-01-10 08:18:19,980 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:19,980 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, 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 08:18:20,001 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 08:18:20,187 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 08:18:20,187 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash 20089351, now seen corresponding path program 1 times [2022-01-10 08:18:20,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897394592] [2022-01-10 08:18:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:20,188 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:20,189 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:20,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-01-10 08:18:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:20,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:20,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 08:18:20,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:20,383 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:20,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897394592] [2022-01-10 08:18:20,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897394592] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:20,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:20,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:20,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128626908] [2022-01-10 08:18:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:20,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:20,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:20,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:20,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:20,384 INFO L87 Difference]: Start difference. First operand 2126 states and 2536 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 08:18:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:20,480 INFO L93 Difference]: Finished difference Result 4232 states and 5039 transitions. [2022-01-10 08:18:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:20,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 129 [2022-01-10 08:18:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:20,485 INFO L225 Difference]: With dead ends: 4232 [2022-01-10 08:18:20,485 INFO L226 Difference]: Without dead ends: 2120 [2022-01-10 08:18:20,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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 08:18:20,489 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 208 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 217 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 08:18:20,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-01-10 08:18:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2120. [2022-01-10 08:18:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 1889 states have (on average 1.1953414505029116) internal successors, (2258), 1903 states have internal predecessors, (2258), 122 states have call successors, (122), 97 states have call predecessors, (122), 108 states have return successors, (144), 120 states have call predecessors, (144), 120 states have call successors, (144) [2022-01-10 08:18:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2524 transitions. [2022-01-10 08:18:20,590 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2524 transitions. Word has length 129 [2022-01-10 08:18:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:20,591 INFO L470 AbstractCegarLoop]: Abstraction has 2120 states and 2524 transitions. [2022-01-10 08:18:20,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 08:18:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2524 transitions. [2022-01-10 08:18:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-10 08:18:20,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:20,593 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, 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] [2022-01-10 08:18:20,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:20,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:20,803 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1806695470, now seen corresponding path program 1 times [2022-01-10 08:18:20,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:20,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190925973] [2022-01-10 08:18:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:20,804 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:20,805 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-01-10 08:18:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:20,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 08:18:20,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:18:21,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:21,052 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:21,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190925973] [2022-01-10 08:18:21,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190925973] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:21,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:21,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:21,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313708015] [2022-01-10 08:18:21,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:21,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:21,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:21,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:21,053 INFO L87 Difference]: Start difference. First operand 2120 states and 2524 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 08:18:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:21,326 INFO L93 Difference]: Finished difference Result 6021 states and 7179 transitions. [2022-01-10 08:18:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:21,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 130 [2022-01-10 08:18:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:21,334 INFO L225 Difference]: With dead ends: 6021 [2022-01-10 08:18:21,334 INFO L226 Difference]: Without dead ends: 3915 [2022-01-10 08:18:21,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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 08:18:21,337 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 234 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:21,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 592 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2022-01-10 08:18:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3911. [2022-01-10 08:18:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3911 states, 3477 states have (on average 1.1886683922922059) internal successors, (4133), 3508 states have internal predecessors, (4133), 225 states have call successors, (225), 177 states have call predecessors, (225), 208 states have return successors, (291), 227 states have call predecessors, (291), 223 states have call successors, (291) [2022-01-10 08:18:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3911 states to 3911 states and 4649 transitions. [2022-01-10 08:18:21,510 INFO L78 Accepts]: Start accepts. Automaton has 3911 states and 4649 transitions. Word has length 130 [2022-01-10 08:18:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:21,510 INFO L470 AbstractCegarLoop]: Abstraction has 3911 states and 4649 transitions. [2022-01-10 08:18:21,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 08:18:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3911 states and 4649 transitions. [2022-01-10 08:18:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-01-10 08:18:21,512 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:21,512 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, 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] [2022-01-10 08:18:21,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:21,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:21,719 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 714060268, now seen corresponding path program 1 times [2022-01-10 08:18:21,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879071880] [2022-01-10 08:18:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:21,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:21,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:21,721 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:21,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-01-10 08:18:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:21,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:21,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 08:18:21,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:21,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:21,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879071880] [2022-01-10 08:18:21,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879071880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:21,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:21,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:21,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048044026] [2022-01-10 08:18:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:21,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:21,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:21,927 INFO L87 Difference]: Start difference. First operand 3911 states and 4649 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 08:18:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:22,084 INFO L93 Difference]: Finished difference Result 7803 states and 9268 transitions. [2022-01-10 08:18:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 130 [2022-01-10 08:18:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:22,093 INFO L225 Difference]: With dead ends: 7803 [2022-01-10 08:18:22,093 INFO L226 Difference]: Without dead ends: 3906 [2022-01-10 08:18:22,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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 08:18:22,099 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 206 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 216 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 08:18:22,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 216 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:22,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2022-01-10 08:18:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3906. [2022-01-10 08:18:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3906 states, 3475 states have (on average 1.1882014388489208) internal successors, (4129), 3505 states have internal predecessors, (4129), 222 states have call successors, (222), 177 states have call predecessors, (222), 208 states have return successors, (288), 224 states have call predecessors, (288), 220 states have call successors, (288) [2022-01-10 08:18:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 4639 transitions. [2022-01-10 08:18:22,289 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 4639 transitions. Word has length 130 [2022-01-10 08:18:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:22,289 INFO L470 AbstractCegarLoop]: Abstraction has 3906 states and 4639 transitions. [2022-01-10 08:18:22,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 08:18:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 4639 transitions. [2022-01-10 08:18:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 08:18:22,291 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:22,291 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, 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 08:18:22,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:22,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:22,498 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:22,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash 569420013, now seen corresponding path program 1 times [2022-01-10 08:18:22,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:22,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196617632] [2022-01-10 08:18:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:22,499 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:22,500 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:22,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-01-10 08:18:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:22,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 08:18:22,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:18:22,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:22,761 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:22,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196617632] [2022-01-10 08:18:22,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196617632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:22,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:22,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:22,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463086685] [2022-01-10 08:18:22,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:22,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:22,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:22,762 INFO L87 Difference]: Start difference. First operand 3906 states and 4639 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 08:18:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:23,181 INFO L93 Difference]: Finished difference Result 11038 states and 13132 transitions. [2022-01-10 08:18:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:23,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 131 [2022-01-10 08:18:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:23,200 INFO L225 Difference]: With dead ends: 11038 [2022-01-10 08:18:23,200 INFO L226 Difference]: Without dead ends: 7146 [2022-01-10 08:18:23,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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 08:18:23,211 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 226 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:23,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 557 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2022-01-10 08:18:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 7142. [2022-01-10 08:18:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7142 states, 6332 states have (on average 1.184144030322173) internal successors, (7498), 6399 states have internal predecessors, (7498), 409 states have call successors, (409), 321 states have call predecessors, (409), 400 states have return successors, (571), 423 states have call predecessors, (571), 407 states have call successors, (571) [2022-01-10 08:18:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7142 states to 7142 states and 8478 transitions. [2022-01-10 08:18:23,598 INFO L78 Accepts]: Start accepts. Automaton has 7142 states and 8478 transitions. Word has length 131 [2022-01-10 08:18:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:23,598 INFO L470 AbstractCegarLoop]: Abstraction has 7142 states and 8478 transitions. [2022-01-10 08:18:23,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 08:18:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7142 states and 8478 transitions. [2022-01-10 08:18:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 08:18:23,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:23,603 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, 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 08:18:23,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:23,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:23,809 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -523215189, now seen corresponding path program 1 times [2022-01-10 08:18:23,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:23,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420099986] [2022-01-10 08:18:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:23,810 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:23,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:23,811 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:23,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-01-10 08:18:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:23,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:23,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 08:18:24,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:24,005 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420099986] [2022-01-10 08:18:24,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420099986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:24,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:24,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:24,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463783899] [2022-01-10 08:18:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:24,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:24,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:24,006 INFO L87 Difference]: Start difference. First operand 7142 states and 8478 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 08:18:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:24,346 INFO L93 Difference]: Finished difference Result 14266 states and 16929 transitions. [2022-01-10 08:18:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 131 [2022-01-10 08:18:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:24,385 INFO L225 Difference]: With dead ends: 14266 [2022-01-10 08:18:24,386 INFO L226 Difference]: Without dead ends: 7138 [2022-01-10 08:18:24,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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 08:18:24,394 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 204 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 215 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 08:18:24,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 215 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7138 states. [2022-01-10 08:18:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7138 to 7138. [2022-01-10 08:18:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7138 states, 6331 states have (on average 1.1840151634812826) internal successors, (7496), 6397 states have internal predecessors, (7496), 406 states have call successors, (406), 321 states have call predecessors, (406), 400 states have return successors, (568), 420 states have call predecessors, (568), 404 states have call successors, (568) [2022-01-10 08:18:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7138 states to 7138 states and 8470 transitions. [2022-01-10 08:18:24,735 INFO L78 Accepts]: Start accepts. Automaton has 7138 states and 8470 transitions. Word has length 131 [2022-01-10 08:18:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:24,736 INFO L470 AbstractCegarLoop]: Abstraction has 7138 states and 8470 transitions. [2022-01-10 08:18:24,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 08:18:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 7138 states and 8470 transitions. [2022-01-10 08:18:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 08:18:24,739 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:24,739 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, 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] [2022-01-10 08:18:24,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-01-10 08:18:24,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:24,946 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 688892810, now seen corresponding path program 1 times [2022-01-10 08:18:24,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:24,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327491083] [2022-01-10 08:18:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:24,947 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:24,948 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:24,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-01-10 08:18:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:25,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:25,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:18:25,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:25,133 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:25,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327491083] [2022-01-10 08:18:25,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327491083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:25,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:25,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:25,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418871378] [2022-01-10 08:18:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:25,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:25,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:25,134 INFO L87 Difference]: Start difference. First operand 7138 states and 8470 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 08:18:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:25,724 INFO L93 Difference]: Finished difference Result 19661 states and 23395 transitions. [2022-01-10 08:18:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 132 [2022-01-10 08:18:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:25,753 INFO L225 Difference]: With dead ends: 19661 [2022-01-10 08:18:25,753 INFO L226 Difference]: Without dead ends: 9866 [2022-01-10 08:18:25,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 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 08:18:25,769 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 160 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 588 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 08:18:25,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 588 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9866 states. [2022-01-10 08:18:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9866 to 9866. [2022-01-10 08:18:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9866 states, 8739 states have (on average 1.1782812678796202) internal successors, (10297), 8821 states have internal predecessors, (10297), 574 states have call successors, (574), 449 states have call predecessors, (574), 552 states have return successors, (818), 596 states have call predecessors, (818), 572 states have call successors, (818) [2022-01-10 08:18:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 11689 transitions. [2022-01-10 08:18:26,269 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 11689 transitions. Word has length 132 [2022-01-10 08:18:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:26,269 INFO L470 AbstractCegarLoop]: Abstraction has 9866 states and 11689 transitions. [2022-01-10 08:18:26,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 08:18:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 11689 transitions. [2022-01-10 08:18:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-10 08:18:26,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:26,274 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:26,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:26,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:26,481 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:26,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1368012302, now seen corresponding path program 1 times [2022-01-10 08:18:26,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:26,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789311772] [2022-01-10 08:18:26,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:26,482 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:26,483 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:26,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-01-10 08:18:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:26,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:26,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:18:26,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:26,772 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:26,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789311772] [2022-01-10 08:18:26,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789311772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:26,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:26,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:18:26,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003841089] [2022-01-10 08:18:26,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:26,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:26,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:26,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:26,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:26,773 INFO L87 Difference]: Start difference. First operand 9866 states and 11689 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 08:18:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:27,300 INFO L93 Difference]: Finished difference Result 22471 states and 26663 transitions. [2022-01-10 08:18:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 169 [2022-01-10 08:18:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:27,323 INFO L225 Difference]: With dead ends: 22471 [2022-01-10 08:18:27,323 INFO L226 Difference]: Without dead ends: 12618 [2022-01-10 08:18:27,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 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 08:18:27,337 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 88 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 415 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 08:18:27,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 415 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2022-01-10 08:18:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 12570. [2022-01-10 08:18:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12570 states, 11123 states have (on average 1.1688393419041625) internal successors, (13001), 11221 states have internal predecessors, (13001), 742 states have call successors, (742), 577 states have call predecessors, (742), 704 states have return successors, (1046), 772 states have call predecessors, (1046), 740 states have call successors, (1046) [2022-01-10 08:18:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 14789 transitions. [2022-01-10 08:18:27,993 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 14789 transitions. Word has length 169 [2022-01-10 08:18:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:27,994 INFO L470 AbstractCegarLoop]: Abstraction has 12570 states and 14789 transitions. [2022-01-10 08:18:27,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 08:18:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 14789 transitions. [2022-01-10 08:18:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-10 08:18:28,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:28,003 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, 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 08:18:28,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:28,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:28,210 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:28,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1638003366, now seen corresponding path program 1 times [2022-01-10 08:18:28,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:28,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831852899] [2022-01-10 08:18:28,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:28,211 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:28,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:28,212 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:28,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-01-10 08:18:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:28,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:18:28,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-01-10 08:18:28,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:28,559 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:28,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831852899] [2022-01-10 08:18:28,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831852899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:28,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:28,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:18:28,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818292297] [2022-01-10 08:18:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:28,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:18:28,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:18:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:18:28,561 INFO L87 Difference]: Start difference. First operand 12570 states and 14789 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 08:18:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:29,452 INFO L93 Difference]: Finished difference Result 25256 states and 29784 transitions. [2022-01-10 08:18:29,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:18:29,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 189 [2022-01-10 08:18:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:29,484 INFO L225 Difference]: With dead ends: 25256 [2022-01-10 08:18:29,484 INFO L226 Difference]: Without dead ends: 12700 [2022-01-10 08:18:29,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 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 08:18:29,500 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 233 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:29,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 482 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:18:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12700 states. [2022-01-10 08:18:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12700 to 12700. [2022-01-10 08:18:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12700 states, 11237 states have (on average 1.1591172021002047) internal successors, (13025), 11343 states have internal predecessors, (13025), 742 states have call successors, (742), 577 states have call predecessors, (742), 720 states have return successors, (944), 780 states have call predecessors, (944), 740 states have call successors, (944) [2022-01-10 08:18:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 14711 transitions. [2022-01-10 08:18:30,202 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 14711 transitions. Word has length 189 [2022-01-10 08:18:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:30,202 INFO L470 AbstractCegarLoop]: Abstraction has 12700 states and 14711 transitions. [2022-01-10 08:18:30,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 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 08:18:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 14711 transitions. [2022-01-10 08:18:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-01-10 08:18:30,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:30,209 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:30,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-01-10 08:18:30,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:30,417 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2113295538, now seen corresponding path program 1 times [2022-01-10 08:18:30,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:30,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210749324] [2022-01-10 08:18:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:30,418 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:30,418 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:30,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-01-10 08:18:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:30,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:30,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:18:30,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:30,682 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:30,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210749324] [2022-01-10 08:18:30,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210749324] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:30,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:30,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:30,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861934806] [2022-01-10 08:18:30,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:30,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:30,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:30,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:30,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:30,684 INFO L87 Difference]: Start difference. First operand 12700 states and 14711 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 08:18:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:31,256 INFO L93 Difference]: Finished difference Result 22700 states and 26361 transitions. [2022-01-10 08:18:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:31,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 190 [2022-01-10 08:18:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:31,281 INFO L225 Difference]: With dead ends: 22700 [2022-01-10 08:18:31,281 INFO L226 Difference]: Without dead ends: 12704 [2022-01-10 08:18:31,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 188 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 08:18:31,291 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 163 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 573 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 08:18:31,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 573 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2022-01-10 08:18:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12700. [2022-01-10 08:18:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12700 states, 11237 states have (on average 1.1568034172821928) internal successors, (12999), 11343 states have internal predecessors, (12999), 742 states have call successors, (742), 577 states have call predecessors, (742), 720 states have return successors, (938), 780 states have call predecessors, (938), 740 states have call successors, (938) [2022-01-10 08:18:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12700 states to 12700 states and 14679 transitions. [2022-01-10 08:18:31,935 INFO L78 Accepts]: Start accepts. Automaton has 12700 states and 14679 transitions. Word has length 190 [2022-01-10 08:18:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:31,936 INFO L470 AbstractCegarLoop]: Abstraction has 12700 states and 14679 transitions. [2022-01-10 08:18:31,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 08:18:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12700 states and 14679 transitions. [2022-01-10 08:18:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-01-10 08:18:31,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:31,944 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:31,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:32,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:32,152 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:32,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1057556914, now seen corresponding path program 1 times [2022-01-10 08:18:32,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:32,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305019298] [2022-01-10 08:18:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:32,153 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:32,154 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:32,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-01-10 08:18:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:32,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:32,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-01-10 08:18:32,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:32,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305019298] [2022-01-10 08:18:32,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305019298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:32,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:32,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:18:32,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234364133] [2022-01-10 08:18:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:32,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:32,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:32,532 INFO L87 Difference]: Start difference. First operand 12700 states and 14679 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 08:18:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:33,327 INFO L93 Difference]: Finished difference Result 27773 states and 32115 transitions. [2022-01-10 08:18:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:33,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 227 [2022-01-10 08:18:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:33,362 INFO L225 Difference]: With dead ends: 27773 [2022-01-10 08:18:33,363 INFO L226 Difference]: Without dead ends: 15086 [2022-01-10 08:18:33,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 225 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 08:18:33,386 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 69 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 412 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 08:18:33,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 412 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15086 states. [2022-01-10 08:18:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15086 to 15022. [2022-01-10 08:18:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15022 states, 13279 states have (on average 1.1491076135251148) internal successors, (15259), 13397 states have internal predecessors, (15259), 894 states have call successors, (894), 689 states have call predecessors, (894), 848 states have return successors, (1118), 936 states have call predecessors, (1118), 892 states have call successors, (1118) [2022-01-10 08:18:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15022 states to 15022 states and 17271 transitions. [2022-01-10 08:18:34,272 INFO L78 Accepts]: Start accepts. Automaton has 15022 states and 17271 transitions. Word has length 227 [2022-01-10 08:18:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:34,272 INFO L470 AbstractCegarLoop]: Abstraction has 15022 states and 17271 transitions. [2022-01-10 08:18:34,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 08:18:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15022 states and 17271 transitions. [2022-01-10 08:18:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-01-10 08:18:34,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:34,283 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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 08:18:34,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:34,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:34,484 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:34,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1861005721, now seen corresponding path program 1 times [2022-01-10 08:18:34,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:34,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645049600] [2022-01-10 08:18:34,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:34,485 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:34,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:34,486 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:34,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-01-10 08:18:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:34,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:34,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-01-10 08:18:34,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:34,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:34,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645049600] [2022-01-10 08:18:34,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645049600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:34,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:34,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:34,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138943166] [2022-01-10 08:18:34,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:34,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:34,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:34,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:34,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:34,805 INFO L87 Difference]: Start difference. First operand 15022 states and 17271 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 08:18:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:35,425 INFO L93 Difference]: Finished difference Result 27712 states and 31935 transitions. [2022-01-10 08:18:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 231 [2022-01-10 08:18:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:35,456 INFO L225 Difference]: With dead ends: 27712 [2022-01-10 08:18:35,457 INFO L226 Difference]: Without dead ends: 15026 [2022-01-10 08:18:35,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 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 08:18:35,478 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 159 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 562 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 08:18:35,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 562 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15026 states. [2022-01-10 08:18:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15026 to 15022. [2022-01-10 08:18:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15022 states, 13279 states have (on average 1.146245952255441) internal successors, (15221), 13397 states have internal predecessors, (15221), 894 states have call successors, (894), 689 states have call predecessors, (894), 848 states have return successors, (1100), 936 states have call predecessors, (1100), 892 states have call successors, (1100) [2022-01-10 08:18:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15022 states to 15022 states and 17215 transitions. [2022-01-10 08:18:36,230 INFO L78 Accepts]: Start accepts. Automaton has 15022 states and 17215 transitions. Word has length 231 [2022-01-10 08:18:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:36,230 INFO L470 AbstractCegarLoop]: Abstraction has 15022 states and 17215 transitions. [2022-01-10 08:18:36,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 08:18:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 15022 states and 17215 transitions. [2022-01-10 08:18:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 08:18:36,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:36,243 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:36,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-01-10 08:18:36,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:36,443 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1006718403, now seen corresponding path program 1 times [2022-01-10 08:18:36,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:36,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521634652] [2022-01-10 08:18:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:36,444 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:36,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:36,445 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:36,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-01-10 08:18:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:36,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:36,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-01-10 08:18:36,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:36,869 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:36,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521634652] [2022-01-10 08:18:36,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521634652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:36,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:36,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:18:36,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479746454] [2022-01-10 08:18:36,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:36,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:36,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:36,870 INFO L87 Difference]: Start difference. First operand 15022 states and 17215 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-10 08:18:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:37,604 INFO L93 Difference]: Finished difference Result 32047 states and 36695 transitions. [2022-01-10 08:18:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:37,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 268 [2022-01-10 08:18:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:37,637 INFO L225 Difference]: With dead ends: 32047 [2022-01-10 08:18:37,638 INFO L226 Difference]: Without dead ends: 17038 [2022-01-10 08:18:37,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 266 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 08:18:37,653 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 54 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 444 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 08:18:37,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 444 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17038 states. [2022-01-10 08:18:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17038 to 16958. [2022-01-10 08:18:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16958 states, 14975 states have (on average 1.1392988313856427) internal successors, (17061), 15101 states have internal predecessors, (17061), 1030 states have call successors, (1030), 785 states have call predecessors, (1030), 952 states have return successors, (1244), 1072 states have call predecessors, (1244), 1028 states have call successors, (1244) [2022-01-10 08:18:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16958 states to 16958 states and 19335 transitions. [2022-01-10 08:18:38,390 INFO L78 Accepts]: Start accepts. Automaton has 16958 states and 19335 transitions. Word has length 268 [2022-01-10 08:18:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:38,391 INFO L470 AbstractCegarLoop]: Abstraction has 16958 states and 19335 transitions. [2022-01-10 08:18:38,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-10 08:18:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16958 states and 19335 transitions. [2022-01-10 08:18:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-01-10 08:18:38,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:38,405 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:38,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-01-10 08:18:38,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:38,606 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1022274172, now seen corresponding path program 1 times [2022-01-10 08:18:38,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:38,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561272578] [2022-01-10 08:18:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:38,607 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:38,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:38,607 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:38,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-01-10 08:18:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:38,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:38,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-01-10 08:18:38,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:38,979 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561272578] [2022-01-10 08:18:38,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561272578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:38,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:38,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:38,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731240291] [2022-01-10 08:18:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:38,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:38,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:38,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:38,980 INFO L87 Difference]: Start difference. First operand 16958 states and 19335 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:39,282 INFO L93 Difference]: Finished difference Result 21572 states and 24566 transitions. [2022-01-10 08:18:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 272 [2022-01-10 08:18:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:39,291 INFO L225 Difference]: With dead ends: 21572 [2022-01-10 08:18:39,292 INFO L226 Difference]: Without dead ends: 4004 [2022-01-10 08:18:39,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 270 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 08:18:39,312 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 156 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 479 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 08:18:39,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 479 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2022-01-10 08:18:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 4004. [2022-01-10 08:18:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3509 states have (on average 1.0929039612425193) internal successors, (3835), 3529 states have internal predecessors, (3835), 282 states have call successors, (282), 197 states have call predecessors, (282), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2022-01-10 08:18:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 4413 transitions. [2022-01-10 08:18:39,549 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 4413 transitions. Word has length 272 [2022-01-10 08:18:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:39,549 INFO L470 AbstractCegarLoop]: Abstraction has 4004 states and 4413 transitions. [2022-01-10 08:18:39,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 4413 transitions. [2022-01-10 08:18:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-01-10 08:18:39,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:39,553 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 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 08:18:39,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2022-01-10 08:18:39,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:39,754 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1612665394, now seen corresponding path program 1 times [2022-01-10 08:18:39,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:39,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866283890] [2022-01-10 08:18:39,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:39,755 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:39,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:39,756 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:39,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-01-10 08:18:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:39,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:39,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-01-10 08:18:40,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:40,121 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:40,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866283890] [2022-01-10 08:18:40,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866283890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:40,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:40,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:40,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452842074] [2022-01-10 08:18:40,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:40,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:40,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:40,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:40,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:40,122 INFO L87 Difference]: Start difference. First operand 4004 states and 4413 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:40,284 INFO L93 Difference]: Finished difference Result 6586 states and 7320 transitions. [2022-01-10 08:18:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 272 [2022-01-10 08:18:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:40,290 INFO L225 Difference]: With dead ends: 6586 [2022-01-10 08:18:40,291 INFO L226 Difference]: Without dead ends: 4004 [2022-01-10 08:18:40,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 270 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 08:18:40,294 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 172 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 501 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 08:18:40,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 501 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2022-01-10 08:18:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 4004. [2022-01-10 08:18:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3509 states have (on average 1.0843545169563977) internal successors, (3805), 3529 states have internal predecessors, (3805), 282 states have call successors, (282), 197 states have call predecessors, (282), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2022-01-10 08:18:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 4383 transitions. [2022-01-10 08:18:40,454 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 4383 transitions. Word has length 272 [2022-01-10 08:18:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:40,454 INFO L470 AbstractCegarLoop]: Abstraction has 4004 states and 4383 transitions. [2022-01-10 08:18:40,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 4383 transitions. [2022-01-10 08:18:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-01-10 08:18:40,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:40,458 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 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 08:18:40,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:40,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:40,659 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash -41340255, now seen corresponding path program 1 times [2022-01-10 08:18:40,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:40,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989696286] [2022-01-10 08:18:40,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:40,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:40,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:40,661 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:40,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-01-10 08:18:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:40,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:40,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-01-10 08:18:41,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:41,043 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989696286] [2022-01-10 08:18:41,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989696286] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:41,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:41,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:41,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433833142] [2022-01-10 08:18:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:41,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:41,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:41,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:41,044 INFO L87 Difference]: Start difference. First operand 4004 states and 4383 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 08:18:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:41,283 INFO L93 Difference]: Finished difference Result 8490 states and 9409 transitions. [2022-01-10 08:18:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 275 [2022-01-10 08:18:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:41,290 INFO L225 Difference]: With dead ends: 8490 [2022-01-10 08:18:41,290 INFO L226 Difference]: Without dead ends: 4241 [2022-01-10 08:18:41,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 273 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 08:18:41,295 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 159 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:41,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 428 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4241 states. [2022-01-10 08:18:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4241 to 4207. [2022-01-10 08:18:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4207 states, 3686 states have (on average 1.078676071622355) internal successors, (3976), 3707 states have internal predecessors, (3976), 297 states have call successors, (297), 207 states have call predecessors, (297), 223 states have return successors, (315), 293 states have call predecessors, (315), 295 states have call successors, (315) [2022-01-10 08:18:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 4588 transitions. [2022-01-10 08:18:41,468 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 4588 transitions. Word has length 275 [2022-01-10 08:18:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:41,468 INFO L470 AbstractCegarLoop]: Abstraction has 4207 states and 4588 transitions. [2022-01-10 08:18:41,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 08:18:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 4588 transitions. [2022-01-10 08:18:41,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-01-10 08:18:41,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:41,474 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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 08:18:41,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:41,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:41,683 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2029947409, now seen corresponding path program 1 times [2022-01-10 08:18:41,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:41,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824140896] [2022-01-10 08:18:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:41,684 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:41,685 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:41,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-01-10 08:18:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:41,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:41,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-01-10 08:18:42,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:42,058 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:42,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824140896] [2022-01-10 08:18:42,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824140896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:42,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:42,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:42,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559515712] [2022-01-10 08:18:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:42,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:42,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:42,059 INFO L87 Difference]: Start difference. First operand 4207 states and 4588 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:42,308 INFO L93 Difference]: Finished difference Result 8665 states and 9574 transitions. [2022-01-10 08:18:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 277 [2022-01-10 08:18:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:42,315 INFO L225 Difference]: With dead ends: 8665 [2022-01-10 08:18:42,315 INFO L226 Difference]: Without dead ends: 4476 [2022-01-10 08:18:42,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 275 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 08:18:42,320 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 148 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 413 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 08:18:42,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 413 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2022-01-10 08:18:42,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4474. [2022-01-10 08:18:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 3919 states have (on average 1.0722122990558816) internal successors, (4202), 3943 states have internal predecessors, (4202), 316 states have call successors, (316), 221 states have call predecessors, (316), 238 states have return successors, (342), 310 states have call predecessors, (342), 314 states have call successors, (342) [2022-01-10 08:18:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 4860 transitions. [2022-01-10 08:18:42,548 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 4860 transitions. Word has length 277 [2022-01-10 08:18:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:42,549 INFO L470 AbstractCegarLoop]: Abstraction has 4474 states and 4860 transitions. [2022-01-10 08:18:42,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 4860 transitions. [2022-01-10 08:18:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-01-10 08:18:42,553 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:42,554 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 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 08:18:42,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-01-10 08:18:42,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:42,754 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:42,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -502446827, now seen corresponding path program 1 times [2022-01-10 08:18:42,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:42,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509330426] [2022-01-10 08:18:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:42,755 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:42,756 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:42,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-01-10 08:18:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:42,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:42,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-01-10 08:18:43,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:43,157 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:43,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509330426] [2022-01-10 08:18:43,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509330426] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:43,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:43,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:43,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584845958] [2022-01-10 08:18:43,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:43,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:43,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:43,159 INFO L87 Difference]: Start difference. First operand 4474 states and 4860 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:43,405 INFO L93 Difference]: Finished difference Result 8090 states and 8850 transitions. [2022-01-10 08:18:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:43,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 279 [2022-01-10 08:18:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:43,413 INFO L225 Difference]: With dead ends: 8090 [2022-01-10 08:18:43,413 INFO L226 Difference]: Without dead ends: 4474 [2022-01-10 08:18:43,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 277 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 08:18:43,423 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 149 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 432 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 08:18:43,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 432 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2022-01-10 08:18:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 4474. [2022-01-10 08:18:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 3919 states have (on average 1.0630262822148506) internal successors, (4166), 3943 states have internal predecessors, (4166), 316 states have call successors, (316), 221 states have call predecessors, (316), 238 states have return successors, (342), 310 states have call predecessors, (342), 314 states have call successors, (342) [2022-01-10 08:18:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 4824 transitions. [2022-01-10 08:18:43,635 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 4824 transitions. Word has length 279 [2022-01-10 08:18:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:43,635 INFO L470 AbstractCegarLoop]: Abstraction has 4474 states and 4824 transitions. [2022-01-10 08:18:43,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-10 08:18:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 4824 transitions. [2022-01-10 08:18:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-01-10 08:18:43,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:43,640 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 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 08:18:43,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Ended with exit code 0 [2022-01-10 08:18:43,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:43,840 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1169949443, now seen corresponding path program 1 times [2022-01-10 08:18:43,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:43,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195383532] [2022-01-10 08:18:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:43,841 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:43,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:43,842 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:43,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-01-10 08:18:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:43,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:43,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-01-10 08:18:44,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:44,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:44,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195383532] [2022-01-10 08:18:44,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195383532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:44,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:44,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:44,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072587700] [2022-01-10 08:18:44,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:44,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:44,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:44,316 INFO L87 Difference]: Start difference. First operand 4474 states and 4824 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 08:18:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:44,492 INFO L93 Difference]: Finished difference Result 5943 states and 6412 transitions. [2022-01-10 08:18:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 282 [2022-01-10 08:18:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:44,501 INFO L225 Difference]: With dead ends: 5943 [2022-01-10 08:18:44,501 INFO L226 Difference]: Without dead ends: 4271 [2022-01-10 08:18:44,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 280 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 08:18:44,504 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 131 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 497 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 08:18:44,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 497 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2022-01-10 08:18:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 4271. [2022-01-10 08:18:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 3742 states have (on average 1.0611972207375735) internal successors, (3971), 3765 states have internal predecessors, (3971), 301 states have call successors, (301), 211 states have call predecessors, (301), 227 states have return successors, (323), 295 states have call predecessors, (323), 299 states have call successors, (323) [2022-01-10 08:18:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 4595 transitions. [2022-01-10 08:18:44,689 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 4595 transitions. Word has length 282 [2022-01-10 08:18:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:44,689 INFO L470 AbstractCegarLoop]: Abstraction has 4271 states and 4595 transitions. [2022-01-10 08:18:44,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 08:18:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 4595 transitions. [2022-01-10 08:18:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-01-10 08:18:44,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:44,693 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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 08:18:44,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Ended with exit code 0 [2022-01-10 08:18:44,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:44,894 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:44,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1721411163, now seen corresponding path program 2 times [2022-01-10 08:18:44,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:44,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198705717] [2022-01-10 08:18:44,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 08:18:44,895 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:44,896 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:44,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-01-10 08:18:45,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 08:18:45,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 08:18:45,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:18:45,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 141 proven. 183 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 08:18:45,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:18:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2022-01-10 08:18:45,812 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:45,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198705717] [2022-01-10 08:18:45,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198705717] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 08:18:45,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 08:18:45,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2022-01-10 08:18:45,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391651822] [2022-01-10 08:18:45,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:45,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 08:18:45,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:45,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 08:18:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:18:45,813 INFO L87 Difference]: Start difference. First operand 4271 states and 4595 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-01-10 08:18:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:46,243 INFO L93 Difference]: Finished difference Result 4277 states and 4600 transitions. [2022-01-10 08:18:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:18:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 283 [2022-01-10 08:18:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:46,253 INFO L225 Difference]: With dead ends: 4277 [2022-01-10 08:18:46,253 INFO L226 Difference]: Without dead ends: 4274 [2022-01-10 08:18:46,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 558 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:18:46,255 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 513 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:18:46,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1936 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:18:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-01-10 08:18:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 4270. [2022-01-10 08:18:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4270 states, 3742 states have (on average 1.060662747194014) internal successors, (3969), 3764 states have internal predecessors, (3969), 300 states have call successors, (300), 211 states have call predecessors, (300), 227 states have return successors, (323), 295 states have call predecessors, (323), 299 states have call successors, (323) [2022-01-10 08:18:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 4592 transitions. [2022-01-10 08:18:46,452 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 4592 transitions. Word has length 283 [2022-01-10 08:18:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:46,452 INFO L470 AbstractCegarLoop]: Abstraction has 4270 states and 4592 transitions. [2022-01-10 08:18:46,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-01-10 08:18:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 4592 transitions. [2022-01-10 08:18:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 08:18:46,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:46,456 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:46,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:46,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:46,657 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1497544525, now seen corresponding path program 1 times [2022-01-10 08:18:46,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:46,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712040797] [2022-01-10 08:18:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:46,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:46,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:46,659 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:46,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-01-10 08:18:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:18:46,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:18:46,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:18:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2022-01-10 08:18:47,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:18:47,039 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:18:47,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712040797] [2022-01-10 08:18:47,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712040797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:18:47,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:18:47,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:18:47,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292884548] [2022-01-10 08:18:47,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:18:47,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:18:47,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:18:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:18:47,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:18:47,041 INFO L87 Difference]: Start difference. First operand 4270 states and 4592 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 08:18:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:18:47,275 INFO L93 Difference]: Finished difference Result 6168 states and 6736 transitions. [2022-01-10 08:18:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:18:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 287 [2022-01-10 08:18:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:18:47,284 INFO L225 Difference]: With dead ends: 6168 [2022-01-10 08:18:47,284 INFO L226 Difference]: Without dead ends: 4700 [2022-01-10 08:18:47,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 285 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 08:18:47,286 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 71 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 511 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 08:18:47,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 511 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:18:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2022-01-10 08:18:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 4272. [2022-01-10 08:18:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4272 states, 3744 states have (on average 1.0606303418803418) internal successors, (3971), 3766 states have internal predecessors, (3971), 300 states have call successors, (300), 211 states have call predecessors, (300), 227 states have return successors, (323), 295 states have call predecessors, (323), 299 states have call successors, (323) [2022-01-10 08:18:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 4594 transitions. [2022-01-10 08:18:47,481 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 4594 transitions. Word has length 287 [2022-01-10 08:18:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:18:47,481 INFO L470 AbstractCegarLoop]: Abstraction has 4272 states and 4594 transitions. [2022-01-10 08:18:47,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 08:18:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 4594 transitions. [2022-01-10 08:18:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-01-10 08:18:47,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:18:47,485 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:18:47,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:47,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:47,686 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:18:47,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:18:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash 408271018, now seen corresponding path program 1 times [2022-01-10 08:18:47,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:18:47,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547405760] [2022-01-10 08:18:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:18:47,687 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:18:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:18:47,688 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:18:47,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-01-10 08:18:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:18:47,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 08:18:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:18:48,093 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 08:18:48,093 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 08:18:48,094 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 08:18:48,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 08:18:48,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-01-10 08:18:48,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:18:48,307 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:18:48,311 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 08:18:48,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:18:48 BoogieIcfgContainer [2022-01-10 08:18:48,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 08:18:48,475 INFO L158 Benchmark]: Toolchain (without parser) took 44867.46ms. Allocated memory was 197.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 148.2MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 513.7MB. Max. memory is 8.0GB. [2022-01-10 08:18:48,476 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory was 164.7MB in the beginning and 164.5MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 08:18:48,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.06ms. Allocated memory is still 197.1MB. Free memory was 147.9MB in the beginning and 167.5MB in the end (delta: -19.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-01-10 08:18:48,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.67ms. Allocated memory is still 197.1MB. Free memory was 166.9MB in the beginning and 164.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 08:18:48,476 INFO L158 Benchmark]: Boogie Preprocessor took 32.16ms. Allocated memory is still 197.1MB. Free memory was 164.3MB in the beginning and 161.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 08:18:48,476 INFO L158 Benchmark]: RCFGBuilder took 559.41ms. Allocated memory is still 197.1MB. Free memory was 161.7MB in the beginning and 135.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-10 08:18:48,476 INFO L158 Benchmark]: TraceAbstraction took 43911.40ms. Allocated memory was 197.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 134.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 500.3MB. Max. memory is 8.0GB. [2022-01-10 08:18:48,480 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 197.1MB. Free memory was 164.7MB in the beginning and 164.5MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.06ms. Allocated memory is still 197.1MB. Free memory was 147.9MB in the beginning and 167.5MB in the end (delta: -19.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.67ms. Allocated memory is still 197.1MB. Free memory was 166.9MB in the beginning and 164.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.16ms. Allocated memory is still 197.1MB. Free memory was 164.3MB in the beginning and 161.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 559.41ms. Allocated memory is still 197.1MB. Free memory was 161.7MB in the beginning and 135.0MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 43911.40ms. Allocated memory was 197.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 134.4MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 500.3MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int t2_pc = 0; [L397] int t3_pc = 0; [L398] int m_st ; [L399] int t1_st ; [L400] int t2_st ; [L401] int t3_st ; [L402] int m_i ; [L403] int t1_i ; [L404] int t2_i ; [L405] int t3_i ; [L406] int M_E = 2; [L407] int T1_E = 2; [L408] int T2_E = 2; [L409] int T3_E = 2; [L410] int E_M = 2; [L411] int E_1 = 2; [L412] int E_2 = 2; [L413] int E_3 = 2; [L419] int token ; [L421] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L1118] COND FALSE !(__VERIFIER_nondet_int()) [L1121] CALL main2() [L1105] int __retres1 ; [L1109] CALL init_model2() [L1018] m_i = 1 [L1019] t1_i = 1 [L1020] t2_i = 1 [L1021] t3_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1109] RET init_model2() [L1110] CALL start_simulation2() [L1046] int kernel_st ; [L1047] int tmp ; [L1048] int tmp___0 ; [L1052] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1053] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1054] CALL init_threads2() [L674] COND TRUE m_i == 1 [L675] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L679] COND TRUE t1_i == 1 [L680] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] COND TRUE t2_i == 1 [L685] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L689] COND TRUE t3_i == 1 [L690] t3_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1054] RET init_threads2() [L1055] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L811] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L816] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L821] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L826] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L831] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L836] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L841] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L846] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1055] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1056] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L904] int tmp ; [L905] int tmp___0 ; [L906] int tmp___1 ; [L907] int tmp___2 ; [L911] CALL, EXPR is_master_triggered() [L587] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L590] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L600] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L602] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L606] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L609] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L619] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L621] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L625] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L628] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L638] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L640] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L935] CALL, EXPR is_transmit3_triggered() [L644] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L647] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L657] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L659] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L935] RET, EXPR is_transmit3_triggered() [L935] tmp___2 = is_transmit3_triggered() [L937] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L1056] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1057] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L859] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L864] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L869] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L874] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L879] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L884] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L889] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L894] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1057] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1060] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1063] kernel_st = 1 [L1064] CALL eval2() [L730] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L734] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L737] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L699] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L702] COND TRUE m_st == 0 [L703] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L725] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L737] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L737] tmp = exists_runnable_thread2() [L739] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L744] COND TRUE m_st == 0 [L745] int tmp_ndt_1; [L746] tmp_ndt_1 = __VERIFIER_nondet_int() [L747] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L758] COND TRUE t1_st == 0 [L759] int tmp_ndt_2; [L760] tmp_ndt_2 = __VERIFIER_nondet_int() [L761] COND TRUE \read(tmp_ndt_2) [L763] t1_st = 1 [L764] CALL transmit1() [L482] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L493] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L495] t1_pc = 1 [L496] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L764] RET transmit1() [L772] COND TRUE t2_st == 0 [L773] int tmp_ndt_3; [L774] tmp_ndt_3 = __VERIFIER_nondet_int() [L775] COND TRUE \read(tmp_ndt_3) [L777] t2_st = 1 [L778] CALL transmit2() [L518] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L529] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L531] t2_pc = 1 [L532] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L778] RET transmit2() [L786] COND TRUE t3_st == 0 [L787] int tmp_ndt_4; [L788] tmp_ndt_4 = __VERIFIER_nondet_int() [L789] COND TRUE \read(tmp_ndt_4) [L791] t3_st = 1 [L792] CALL transmit3() [L554] COND TRUE t3_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L565] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L567] t3_pc = 1 [L568] t3_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L792] RET transmit3() [L734] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, tmp_ndt_4=2147483648, token=0] [L737] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L699] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L702] COND TRUE m_st == 0 [L703] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L725] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L737] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, tmp_ndt_4=2147483648, token=0] [L737] tmp = exists_runnable_thread2() [L739] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, tmp_ndt_4=2147483648, token=0] [L744] COND TRUE m_st == 0 [L745] int tmp_ndt_1; [L746] tmp_ndt_1 = __VERIFIER_nondet_int() [L747] COND TRUE \read(tmp_ndt_1) [L749] m_st = 1 [L750] CALL master() [L424] int tmp_var = __VERIFIER_nondet_int(); [L426] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L437] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L440] token = __VERIFIER_nondet_int() [L441] local = token [L442] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L443] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L951] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L904] int tmp ; [L905] int tmp___0 ; [L906] int tmp___1 ; [L907] int tmp___2 ; [L911] CALL, EXPR is_master_triggered() [L587] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L590] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L600] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L602] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L606] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L609] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L610] COND TRUE E_1 == 1 [L611] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L621] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L625] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L628] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L629] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L638] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L640] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L935] CALL, EXPR is_transmit3_triggered() [L644] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L647] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L648] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L657] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L659] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L935] RET, EXPR is_transmit3_triggered() [L935] tmp___2 = is_transmit3_triggered() [L937] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L951] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L443] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L444] E_1 = 2 [L445] m_pc = 1 [L446] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L750] RET master() [L758] COND TRUE t1_st == 0 [L759] int tmp_ndt_2; [L760] tmp_ndt_2 = __VERIFIER_nondet_int() [L761] COND TRUE \read(tmp_ndt_2) [L763] t1_st = 1 [L764] CALL transmit1() [L482] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L485] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L501] token += 1 [L502] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L503] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L951] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L904] int tmp ; [L905] int tmp___0 ; [L906] int tmp___1 ; [L907] int tmp___2 ; [L911] CALL, EXPR is_master_triggered() [L587] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L590] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L591] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L600] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L602] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L606] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L609] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L610] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L619] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L621] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L625] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L628] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L629] COND TRUE E_2 == 1 [L630] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L640] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L935] CALL, EXPR is_transmit3_triggered() [L644] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L647] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L648] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L657] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L659] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L935] RET, EXPR is_transmit3_triggered() [L935] tmp___2 = is_transmit3_triggered() [L937] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L951] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L503] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L504] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L493] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L495] t1_pc = 1 [L496] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L764] RET transmit1() [L772] COND TRUE t2_st == 0 [L773] int tmp_ndt_3; [L774] tmp_ndt_3 = __VERIFIER_nondet_int() [L775] COND TRUE \read(tmp_ndt_3) [L777] t2_st = 1 [L778] CALL transmit2() [L518] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L521] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L537] token += 1 [L538] E_3 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L539] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L951] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L904] int tmp ; [L905] int tmp___0 ; [L906] int tmp___1 ; [L907] int tmp___2 ; [L911] CALL, EXPR is_master_triggered() [L587] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L590] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L591] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L600] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L602] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L606] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L609] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L610] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L619] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L621] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L625] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L628] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L629] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L638] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L640] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L935] CALL, EXPR is_transmit3_triggered() [L644] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L647] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L648] COND TRUE E_3 == 1 [L649] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L659] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L935] RET, EXPR is_transmit3_triggered() [L935] tmp___2 = is_transmit3_triggered() [L937] COND TRUE \read(tmp___2) [L938] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L951] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L539] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L540] E_3 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L529] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L531] t2_pc = 1 [L532] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L778] RET transmit2() [L786] COND TRUE t3_st == 0 [L787] int tmp_ndt_4; [L788] tmp_ndt_4 = __VERIFIER_nondet_int() [L789] COND TRUE \read(tmp_ndt_4) [L791] t3_st = 1 [L792] CALL transmit3() [L554] COND FALSE !(t3_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L557] COND TRUE t3_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L573] token += 1 [L574] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L575] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L951] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L904] int tmp ; [L905] int tmp___0 ; [L906] int tmp___1 ; [L907] int tmp___2 ; [L911] CALL, EXPR is_master_triggered() [L587] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L590] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L591] COND TRUE E_M == 1 [L592] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L602] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L919] CALL, EXPR is_transmit1_triggered() [L606] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L609] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L610] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L619] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L621] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L927] CALL, EXPR is_transmit2_triggered() [L625] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L628] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L629] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L638] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L640] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L935] CALL, EXPR is_transmit3_triggered() [L644] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L647] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L648] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L657] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L659] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L935] RET, EXPR is_transmit3_triggered() [L935] tmp___2 = is_transmit3_triggered() [L937] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L951] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L575] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L576] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L565] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L567] t3_pc = 1 [L568] t3_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L792] RET transmit3() [L734] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=2147483648, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, tmp_ndt_4=2147483648, token=3] [L737] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L699] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L702] COND TRUE m_st == 0 [L703] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L725] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L737] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=2147483648, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, tmp_ndt_4=2147483648, token=3] [L737] tmp = exists_runnable_thread2() [L739] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=2147483648, tmp_ndt_2=2147483648, tmp_ndt_3=2147483648, tmp_ndt_4=2147483648, token=3] [L744] COND TRUE m_st == 0 [L745] int tmp_ndt_1; [L746] tmp_ndt_1 = __VERIFIER_nondet_int() [L747] COND TRUE \read(tmp_ndt_1) [L749] m_st = 1 [L750] CALL master() [L424] int tmp_var = __VERIFIER_nondet_int(); [L426] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L429] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L451] COND FALSE !(token != local + 3) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L456] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L457] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L462] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L463] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L464] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L465] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 27]: 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 11 procedures, 237 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 43.7s, OverallIterations: 47, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10874 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10702 mSDsluCounter, 30566 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16224 mSDsCounter, 671 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2966 IncrementalHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 671 mSolverCounterUnsat, 14342 mSDtfsCounter, 2966 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6687 GetRequests, 6570 SyntacticMatches, 3 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16958occurred in iteration=38, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 46 MinimizatonAttempts, 1858 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 6572 NumberOfCodeBlocks, 6572 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6655 ConstructedInterpolants, 0 QuantifiedInterpolants, 11336 SizeOfPredicates, 16 NumberOfNonLiveVariables, 12631 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 49 InterpolantComputations, 45 PerfectInterpolantSequences, 4334/4547 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 08:18:48,504 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...