/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:33:52,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:33:52,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:33:52,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:33:52,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:33:52,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:33:52,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:33:52,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:33:52,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:33:52,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:33:52,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:33:52,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:33:52,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:33:52,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:33:52,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:33:52,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:33:52,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:33:52,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:33:52,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:33:52,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:33:52,564 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:33:52,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:33:52,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:33:52,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:33:52,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:33:52,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:33:52,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:33:52,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:33:52,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:33:52,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:33:52,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:33:52,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:33:52,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:33:52,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:33:52,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:33:52,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:33:52,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:33:52,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:33:52,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:33:52,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:33:52,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:33:52,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:33:52,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:33:52,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:33:52,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:33:52,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:33:52,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:33:52,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:33:52,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:33:52,673 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:33:52,674 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:33:52,674 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:33:52,675 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:33:52,675 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:33:52,676 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:33:52,676 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:33:52,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:33:52,677 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:33:52,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:33:52,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:33:52,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:33:52,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:33:52,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:33:52,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:33:52,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:33:52,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:33:52,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:33:52,680 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:33:52,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:33:52,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:33:52,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:33:52,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:33:52,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:33:52,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:33:52,684 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:33:52,686 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:33:52,687 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 [2022-07-22 12:33:53,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:33:53,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:33:53,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:33:53,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:33:53,095 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:33:53,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2022-07-22 12:33:53,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c23f5b52/84dd3757294c4bc99cefb44de9daa42b/FLAGd2729007c [2022-07-22 12:33:53,938 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:33:53,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2022-07-22 12:33:53,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c23f5b52/84dd3757294c4bc99cefb44de9daa42b/FLAGd2729007c [2022-07-22 12:33:54,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c23f5b52/84dd3757294c4bc99cefb44de9daa42b [2022-07-22 12:33:54,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:33:54,141 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:33:54,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:33:54,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:33:54,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:33:54,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ac5562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54, skipping insertion in model container [2022-07-22 12:33:54,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:33:54,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:33:54,403 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:33:54,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[30997,31010] [2022-07-22 12:33:54,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[31682,31695] [2022-07-22 12:33:54,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:33:54,665 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:33:54,695 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:33:54,741 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[30997,31010] [2022-07-22 12:33:54,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[31682,31695] [2022-07-22 12:33:54,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:33:54,811 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:33:54,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54 WrapperNode [2022-07-22 12:33:54,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:33:54,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:33:54,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:33:54,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:33:54,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,891 INFO L137 Inliner]: procedures = 171, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2022-07-22 12:33:54,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:33:54,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:33:54,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:33:54,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:33:54,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:33:54,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:33:54,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:33:54,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:33:54,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (1/1) ... [2022-07-22 12:33:54,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:33:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:33:54,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:33:54,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:33:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:33:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-22 12:33:55,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-22 12:33:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-22 12:33:55,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-22 12:33:55,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:33:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:33:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:33:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:33:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:33:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:33:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:33:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:33:55,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:33:55,074 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:33:55,206 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:33:55,208 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:33:55,462 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:33:55,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:33:55,482 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 12:33:55,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:33:55 BoogieIcfgContainer [2022-07-22 12:33:55,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:33:55,491 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:33:55,492 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:33:55,499 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:33:55,500 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:55,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:33:54" (1/3) ... [2022-07-22 12:33:55,502 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a60f2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:33:55, skipping insertion in model container [2022-07-22 12:33:55,502 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:55,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:54" (2/3) ... [2022-07-22 12:33:55,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a60f2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:33:55, skipping insertion in model container [2022-07-22 12:33:55,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:55,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:33:55" (3/3) ... [2022-07-22 12:33:55,505 INFO L322 chiAutomizerObserver]: Analyzing ICFG peterson.i [2022-07-22 12:33:55,600 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:33:55,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 82 transitions, 180 flow [2022-07-22 12:33:55,684 INFO L129 PetriNetUnfolder]: 6/78 cut-off events. [2022-07-22 12:33:55,684 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:33:55,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-07-22 12:33:55,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 82 transitions, 180 flow [2022-07-22 12:33:55,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 78 transitions, 168 flow [2022-07-22 12:33:55,703 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:33:55,717 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 78 transitions, 168 flow [2022-07-22 12:33:55,720 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 78 transitions, 168 flow [2022-07-22 12:33:55,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 78 transitions, 168 flow [2022-07-22 12:33:55,741 INFO L129 PetriNetUnfolder]: 6/78 cut-off events. [2022-07-22 12:33:55,742 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:33:55,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2022-07-22 12:33:55,746 INFO L116 LiptonReduction]: Number of co-enabled transitions 1088 [2022-07-22 12:33:57,757 INFO L131 LiptonReduction]: Checked pairs total: 3551 [2022-07-22 12:33:57,757 INFO L133 LiptonReduction]: Total number of compositions: 53 [2022-07-22 12:33:57,783 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:33:57,784 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:33:57,784 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:33:57,784 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:33:57,784 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:33:57,785 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:33:57,786 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:33:57,786 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:33:57,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:33:57,896 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 76 [2022-07-22 12:33:57,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:57,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:57,904 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:33:57,904 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:33:57,904 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:33:57,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 221 states, but on-demand construction may add more states [2022-07-22 12:33:57,925 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 76 [2022-07-22 12:33:57,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:57,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:57,926 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:33:57,926 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:33:57,938 INFO L748 eck$LassoCheckResult]: Stem: 84#[ULTIMATE.startENTRY]don't care [280] ULTIMATE.startENTRY-->L761-2: Formula: (let ((.cse1 (select |v_#memory_int_44| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_35| 1))) (and (= v_~flag2~0_18 0) (= v_~flag1~0_26 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~1#1.base_35|) 0) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_35|) 0) (= |v_#NULL.base_6| 0) (= (select |v_#valid_85| 1) 1) (= v_~turn~0_14 0) (< 0 |v_#StackHeapBarrier_22|) (= 2 (select |v_#length_52| 1)) (= 48 (select .cse1 0)) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~1#1.base_35|) (= (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_35| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_35|) |v_ULTIMATE.start_main_~#t1~1#1.offset_27| |v_ULTIMATE.start_main_#t~pre4#1_27|)) |v_#memory_int_43|) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_29| 0) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= (select |v_#length_52| 2) 11) (= (select |v_#valid_85| 2) 1) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_27| 0) (= |v_#valid_84| (store .cse0 |v_ULTIMATE.start_main_~#t2~1#1.base_35| 1)) (= v_~x~0_24 0) (= (select |v_#valid_85| 0) 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~1#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~1#1.base_35| 4) |v_#length_51|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~1#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_44|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_35|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_27|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_29|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_18, #valid=|v_#valid_84|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_20|, ~flag1~0=v_~flag1~0_26, #length=|v_#length_51|, ~turn~0=v_~turn~0_14, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_#t~pre4#1, #NULL.base, ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0] 87#[L761-2]don't care [222] L761-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 89#[L761-3, thr1ENTRY]don't care [228] thr1ENTRY-->L706: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_6 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_6, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 93#[L761-3, L706]don't care [205] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 99#[L761-3, L709]don't care [206] L709-->L712: Formula: (= v_~flag2~0_3 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 109#[L761-3, L712]don't care [207] L712-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_1 v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 123#[L761-3, L722]don't care [2022-07-22 12:33:57,938 INFO L750 eck$LassoCheckResult]: Loop: 123#[L761-3, L722]don't care [231] L722-->L719: Formula: (and (= v_thr1Thread1of1ForFork0_~f21~0_11 v_~flag2~0_6) (= v_thr1Thread1of1ForFork0_~t1~0_11 1) (= v_thr1Thread1of1ForFork0_~f21~0_12 1)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_12, ~flag2~0=v_~flag2~0_6, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_11} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_11, ~flag2~0=v_~flag2~0_6, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_11} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 143#[L719, L761-3]don't care [215] L719-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_7 v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 123#[L761-3, L722]don't care [2022-07-22 12:33:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 525748977, now seen corresponding path program 1 times [2022-07-22 12:33:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:57,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553700843] [2022-07-22 12:33:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:58,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash 8337, now seen corresponding path program 1 times [2022-07-22 12:33:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:58,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985968111] [2022-07-22 12:33:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,221 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:58,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1561366655, now seen corresponding path program 1 times [2022-07-22 12:33:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:58,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829519695] [2022-07-22 12:33:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:33:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:33:58,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:33:58,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829519695] [2022-07-22 12:33:58,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829519695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:33:58,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:33:58,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:33:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972460146] [2022-07-22 12:33:58,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:33:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:33:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:33:58,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:33:58,516 INFO L87 Difference]: Start difference. First operand currently 221 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:33:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:33:58,637 INFO L93 Difference]: Finished difference Result 334 states and 778 transitions. [2022-07-22 12:33:58,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 778 transitions. [2022-07-22 12:33:58,669 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 92 [2022-07-22 12:33:58,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 244 states and 573 transitions. [2022-07-22 12:33:58,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 244 [2022-07-22 12:33:58,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 244 [2022-07-22 12:33:58,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 244 states and 573 transitions. [2022-07-22 12:33:58,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:33:58,721 INFO L220 hiAutomatonCegarLoop]: Abstraction has 244 states and 573 transitions. [2022-07-22 12:33:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states and 573 transitions. [2022-07-22 12:33:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 194. [2022-07-22 12:33:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 2.38659793814433) internal successors, (463), 193 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:33:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 463 transitions. [2022-07-22 12:33:58,813 INFO L242 hiAutomatonCegarLoop]: Abstraction has 194 states and 463 transitions. [2022-07-22 12:33:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:33:58,821 INFO L425 stractBuchiCegarLoop]: Abstraction has 194 states and 463 transitions. [2022-07-22 12:33:58,821 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:33:58,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 463 transitions. [2022-07-22 12:33:58,829 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 72 [2022-07-22 12:33:58,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:58,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:58,830 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:33:58,831 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:33:58,831 INFO L748 eck$LassoCheckResult]: Stem: 1256#[ULTIMATE.startENTRY]don't care [280] ULTIMATE.startENTRY-->L761-2: Formula: (let ((.cse1 (select |v_#memory_int_44| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_35| 1))) (and (= v_~flag2~0_18 0) (= v_~flag1~0_26 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~1#1.base_35|) 0) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_35|) 0) (= |v_#NULL.base_6| 0) (= (select |v_#valid_85| 1) 1) (= v_~turn~0_14 0) (< 0 |v_#StackHeapBarrier_22|) (= 2 (select |v_#length_52| 1)) (= 48 (select .cse1 0)) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~1#1.base_35|) (= (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_35| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_35|) |v_ULTIMATE.start_main_~#t1~1#1.offset_27| |v_ULTIMATE.start_main_#t~pre4#1_27|)) |v_#memory_int_43|) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_29| 0) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= (select |v_#length_52| 2) 11) (= (select |v_#valid_85| 2) 1) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_27| 0) (= |v_#valid_84| (store .cse0 |v_ULTIMATE.start_main_~#t2~1#1.base_35| 1)) (= v_~x~0_24 0) (= (select |v_#valid_85| 0) 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~1#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~1#1.base_35| 4) |v_#length_51|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~1#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_44|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_35|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_27|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_29|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_18, #valid=|v_#valid_84|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_20|, ~flag1~0=v_~flag1~0_26, #length=|v_#length_51|, ~turn~0=v_~turn~0_14, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_#t~pre4#1, #NULL.base, ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0] 1250#[L761-2]don't care [222] L761-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 1246#[L761-3, thr1ENTRY]don't care [273] L761-3-->L762-3: Formula: (and (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) |v_ULTIMATE.start_main_~#t2~1#1.offset_21| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_21|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~1#1.base_23|))) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1220#[L762-3, thr1ENTRY]don't care [225] L762-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_10, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_10, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 1222#[thr1ENTRY, thr2ENTRY, L762-4]don't care [241] thr2ENTRY-->L734: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5) (= v_~flag2~0_8 1)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_8, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 918#[thr1ENTRY, L734, L762-4]don't care [188] L734-->L737: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 924#[thr1ENTRY, L737, L762-4]don't care [189] L737-->L740: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 1124#[thr1ENTRY, L740, L762-4]don't care [190] L740-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_1 v_~turn~0_2) InVars {~turn~0=v_~turn~0_2} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_1, ~turn~0=v_~turn~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 1102#[thr1ENTRY, L750, L762-4]don't care [2022-07-22 12:33:58,832 INFO L750 eck$LassoCheckResult]: Loop: 1102#[thr1ENTRY, L750, L762-4]don't care [233] L750-->L747: Formula: (and (= v_thr2Thread1of1ForFork1_~f12~0_12 1) (= v_~flag1~0_8 v_thr2Thread1of1ForFork1_~f12~0_11) (= v_thr2Thread1of1ForFork1_~t2~0_11 0)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_12} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_11} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 1106#[thr1ENTRY, L747, L762-4]don't care [198] L747-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_7 v_~turn~0_3) InVars {~turn~0=v_~turn~0_3} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_7, ~turn~0=v_~turn~0_3} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 1102#[thr1ENTRY, L750, L762-4]don't care [2022-07-22 12:33:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:58,833 INFO L85 PathProgramCache]: Analyzing trace with hash -253561341, now seen corresponding path program 1 times [2022-07-22 12:33:58,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:58,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937582023] [2022-07-22 12:33:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:58,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash 8382, now seen corresponding path program 1 times [2022-07-22 12:33:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:58,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345756810] [2022-07-22 12:33:58,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:58,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,906 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1140694592, now seen corresponding path program 1 times [2022-07-22 12:33:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:58,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620044146] [2022-07-22 12:33:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:58,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:33:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:33:58,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:33:58,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620044146] [2022-07-22 12:33:58,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620044146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:33:58,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:33:58,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:33:58,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859323340] [2022-07-22 12:33:58,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:33:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:33:58,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:33:58,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:33:58,979 INFO L87 Difference]: Start difference. First operand 194 states and 463 transitions. cyclomatic complexity: 303 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:33:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:33:59,085 INFO L93 Difference]: Finished difference Result 256 states and 591 transitions. [2022-07-22 12:33:59,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 591 transitions. [2022-07-22 12:33:59,101 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 76 [2022-07-22 12:33:59,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 206 states and 488 transitions. [2022-07-22 12:33:59,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 206 [2022-07-22 12:33:59,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2022-07-22 12:33:59,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 488 transitions. [2022-07-22 12:33:59,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:33:59,119 INFO L220 hiAutomatonCegarLoop]: Abstraction has 206 states and 488 transitions. [2022-07-22 12:33:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 488 transitions. [2022-07-22 12:33:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 186. [2022-07-22 12:33:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 2.4086021505376345) internal successors, (448), 185 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:33:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 448 transitions. [2022-07-22 12:33:59,161 INFO L242 hiAutomatonCegarLoop]: Abstraction has 186 states and 448 transitions. [2022-07-22 12:33:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:33:59,166 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 448 transitions. [2022-07-22 12:33:59,166 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:33:59,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 448 transitions. [2022-07-22 12:33:59,172 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 68 [2022-07-22 12:33:59,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:59,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:59,178 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:33:59,178 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:33:59,179 INFO L748 eck$LassoCheckResult]: Stem: 1881#[ULTIMATE.startENTRY]don't care [280] ULTIMATE.startENTRY-->L761-2: Formula: (let ((.cse1 (select |v_#memory_int_44| 1)) (.cse0 (store |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_35| 1))) (and (= v_~flag2~0_18 0) (= v_~flag1~0_26 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~1#1.base_35|) 0) (= (select |v_#valid_85| |v_ULTIMATE.start_main_~#t1~1#1.base_35|) 0) (= |v_#NULL.base_6| 0) (= (select |v_#valid_85| 1) 1) (= v_~turn~0_14 0) (< 0 |v_#StackHeapBarrier_22|) (= 2 (select |v_#length_52| 1)) (= 48 (select .cse1 0)) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2~1#1.base_35|) (= (store |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_35| (store (select |v_#memory_int_44| |v_ULTIMATE.start_main_~#t1~1#1.base_35|) |v_ULTIMATE.start_main_~#t1~1#1.offset_27| |v_ULTIMATE.start_main_#t~pre4#1_27|)) |v_#memory_int_43|) (= (select .cse1 1) 0) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_29| 0) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= (select |v_#length_52| 2) 11) (= (select |v_#valid_85| 2) 1) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_27| 0) (= |v_#valid_84| (store .cse0 |v_ULTIMATE.start_main_~#t2~1#1.base_35| 1)) (= v_~x~0_24 0) (= (select |v_#valid_85| 0) 0) (= (store (store |v_#length_52| |v_ULTIMATE.start_main_~#t1~1#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~1#1.base_35| 4) |v_#length_51|) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1~1#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_44|, #length=|v_#length_52|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_35|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_22|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_27|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_29|, #StackHeapBarrier=|v_#StackHeapBarrier_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, ~flag2~0=v_~flag2~0_18, #valid=|v_#valid_84|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_43|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_20|, ~flag1~0=v_~flag1~0_26, #length=|v_#length_51|, ~turn~0=v_~turn~0_14, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_#t~pre4#1, #NULL.base, ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.offset, #pthreadsForks, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~turn~0, ~x~0] 1875#[L761-2]don't care [222] L761-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 1871#[L761-3, thr1ENTRY]don't care [273] L761-3-->L762-3: Formula: (and (= (select |v_#valid_60| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) 1) (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_26|) (= |v_#memory_int_31| (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~1#1.base_23|) |v_ULTIMATE.start_main_~#t2~1#1.offset_21| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_21|) (= |v_#pthreadsForks_25| (+ |v_#pthreadsForks_26| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_21| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~1#1.base_23|))) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_26|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_32|, #length=|v_#length_41|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_23|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_21|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_25|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_31|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1849#[L762-3, thr1ENTRY]don't care [225] L762-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_10, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_10, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 1851#[thr1ENTRY, thr2ENTRY, L762-4]don't care [241] thr2ENTRY-->L734: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5) (= v_~flag2~0_8 1)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_8, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1545#[thr1ENTRY, L734, L762-4]don't care [228] thr1ENTRY-->L706: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_6 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_6, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 1547#[L706, L762-4, L734]don't care [188] L734-->L737: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 1677#[L737, L706, L762-4]don't care [189] L737-->L740: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 1795#[L706, L740, L762-4]don't care [190] L740-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_1 v_~turn~0_2) InVars {~turn~0=v_~turn~0_2} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_1, ~turn~0=v_~turn~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 1777#[L706, L750, L762-4]don't care [2022-07-22 12:33:59,182 INFO L750 eck$LassoCheckResult]: Loop: 1777#[L706, L750, L762-4]don't care [233] L750-->L747: Formula: (and (= v_thr2Thread1of1ForFork1_~f12~0_12 1) (= v_~flag1~0_8 v_thr2Thread1of1ForFork1_~f12~0_11) (= v_thr2Thread1of1ForFork1_~t2~0_11 0)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_12} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_11, ~flag1~0=v_~flag1~0_8, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_11} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 1775#[L706, L747, L762-4]don't care [198] L747-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_7 v_~turn~0_3) InVars {~turn~0=v_~turn~0_3} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_7, ~turn~0=v_~turn~0_3} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 1777#[L706, L750, L762-4]don't care [2022-07-22 12:33:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash 730723859, now seen corresponding path program 1 times [2022-07-22 12:33:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462948635] [2022-07-22 12:33:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:59,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash 8382, now seen corresponding path program 2 times [2022-07-22 12:33:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541190291] [2022-07-22 12:33:59,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2145966672, now seen corresponding path program 1 times [2022-07-22 12:33:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799671060] [2022-07-22 12:33:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:00,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:34:00 BoogieIcfgContainer [2022-07-22 12:34:00,201 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:34:00,202 INFO L158 Benchmark]: Toolchain (without parser) took 6065.67ms. Allocated memory was 152.0MB in the beginning and 182.5MB in the end (delta: 30.4MB). Free memory was 125.7MB in the beginning and 91.5MB in the end (delta: 34.2MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2022-07-22 12:34:00,203 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 152.0MB. Free memory was 123.1MB in the beginning and 123.0MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:34:00,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.19ms. Allocated memory is still 152.0MB. Free memory was 125.6MB in the beginning and 106.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-07-22 12:34:00,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.09ms. Allocated memory is still 152.0MB. Free memory was 106.3MB in the beginning and 104.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:34:00,206 INFO L158 Benchmark]: Boogie Preprocessor took 31.92ms. Allocated memory is still 152.0MB. Free memory was 104.3MB in the beginning and 102.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:00,206 INFO L158 Benchmark]: RCFGBuilder took 565.61ms. Allocated memory is still 152.0MB. Free memory was 102.9MB in the beginning and 125.4MB in the end (delta: -22.5MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-07-22 12:34:00,207 INFO L158 Benchmark]: BuchiAutomizer took 4709.48ms. Allocated memory was 152.0MB in the beginning and 182.5MB in the end (delta: 30.4MB). Free memory was 124.9MB in the beginning and 91.5MB in the end (delta: 33.4MB). Peak memory consumption was 64.3MB. Max. memory is 8.0GB. [2022-07-22 12:34:00,212 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.23ms. Allocated memory is still 152.0MB. Free memory was 123.1MB in the beginning and 123.0MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 668.19ms. Allocated memory is still 152.0MB. Free memory was 125.6MB in the beginning and 106.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.09ms. Allocated memory is still 152.0MB. Free memory was 106.3MB in the beginning and 104.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.92ms. Allocated memory is still 152.0MB. Free memory was 104.3MB in the beginning and 102.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 565.61ms. Allocated memory is still 152.0MB. Free memory was 102.9MB in the beginning and 125.4MB in the end (delta: -22.5MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 4709.48ms. Allocated memory was 152.0MB in the beginning and 182.5MB in the end (delta: 30.4MB). Free memory was 124.9MB in the beginning and 91.5MB in the end (delta: 33.4MB). Peak memory consumption was 64.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 186 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 70 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 31 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 744]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result={0:0}, \result={0:0}, \result=0, _={0:0}, _={0:0}, _={0:0}, _={0:0}, f12=1, f21=0, flag1=1, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21e6896e in-1,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dd0998b in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@52ecec05=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@73736316=0, t1={26886:0}, t1=0, t2=0, t2={26885:0}, turn=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 744]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int flag1 = 0, flag2 = 0; [L701] 0 int turn; [L702] 0 int x; [L760] 0 pthread_t t1, t2; [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L762] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L733] 2 flag2 = 1 [L705] 1 flag1 = 1 [L736] 2 turn = 0 [L739] 2 int f12 = flag1; [L742] 2 int t2 = turn; Loop: [L744] COND TRUE f12==1 && t2==0 [L746] f12 = flag1 [L749] t2 = turn End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 79 PlacesBefore, 33 PlacesAfterwards, 78 TransitionsBefore, 29 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 53 TotalNumberOfCompositions, 3551 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1809, positive: 1618, positive conditional: 0, positive unconditional: 1618, negative: 191, negative conditional: 0, negative unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 574, positive: 547, positive conditional: 0, positive unconditional: 547, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1809, positive: 1071, positive conditional: 0, positive unconditional: 1071, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 574, unknown conditional: 0, unknown unconditional: 574] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:34:00,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...