/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/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:33:52,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:33:52,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:33:53,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:33:53,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:33:53,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:33:53,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:33:53,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:33:53,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:33:53,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:33:53,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:33:53,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:33:53,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:33:53,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:33:53,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:33:53,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:33:53,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:33:53,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:33:53,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:33:53,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:33:53,080 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:33:53,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:33:53,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:33:53,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:33:53,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:33:53,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:33:53,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:33:53,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:33:53,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:33:53,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:33:53,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:33:53,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:33:53,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:33:53,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:33:53,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:33:53,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:33:53,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:33:53,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:33:53,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:33:53,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:33:53,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:33:53,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:33:53,118 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:53,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:33:53,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:33:53,169 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:33:53,169 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:33:53,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:33:53,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:33:53,172 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:33:53,172 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:33:53,172 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:33:53,173 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:33:53,174 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:33:53,174 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:33:53,174 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:33:53,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:33:53,175 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:33:53,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:33:53,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:33:53,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:33:53,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:33:53,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:33:53,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:33:53,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:33:53,176 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:33:53,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:33:53,177 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:33:53,177 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:33:53,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:33:53,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:33:53,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:33:53,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:33:53,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:33:53,179 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:33:53,180 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:33:53,181 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,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:33:53,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:33:53,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:33:53,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:33:53,612 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:33:53,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2022-07-22 12:33:53,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171181f97/a424e48db7ed4ccd8b2c021c7b7946ab/FLAGf3ae4233f [2022-07-22 12:33:54,403 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:33:54,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2022-07-22 12:33:54,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171181f97/a424e48db7ed4ccd8b2c021c7b7946ab/FLAGf3ae4233f [2022-07-22 12:33:54,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171181f97/a424e48db7ed4ccd8b2c021c7b7946ab [2022-07-22 12:33:54,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:33:54,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:33:54,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:33:54,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:33:54,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:33:54,713 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,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ad38c9 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,715 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,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:33:54,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:33:55,121 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:33:55,375 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/dekker.i[31403,31416] [2022-07-22 12:33:55,385 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/dekker.i[32483,32496] [2022-07-22 12:33:55,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:33:55,409 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:33:55,439 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:33:55,481 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/dekker.i[31403,31416] [2022-07-22 12:33:55,493 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/dekker.i[32483,32496] [2022-07-22 12:33:55,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:33:55,560 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:33:55,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:55 WrapperNode [2022-07-22 12:33:55,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:33:55,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:33:55,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:33:55,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:33:55,572 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:55" (1/1) ... [2022-07-22 12:33:55,602 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:55" (1/1) ... [2022-07-22 12:33:55,647 INFO L137 Inliner]: procedures = 172, calls = 60, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-22 12:33:55,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:33:55,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:33:55,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:33:55,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:33:55,658 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:55" (1/1) ... [2022-07-22 12:33:55,658 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:55" (1/1) ... [2022-07-22 12:33:55,662 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:55" (1/1) ... [2022-07-22 12:33:55,662 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:55" (1/1) ... [2022-07-22 12:33:55,669 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:55" (1/1) ... [2022-07-22 12:33:55,675 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:55" (1/1) ... [2022-07-22 12:33:55,677 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:55" (1/1) ... [2022-07-22 12:33:55,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:33:55,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:33:55,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:33:55,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:33:55,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:55" (1/1) ... [2022-07-22 12:33:55,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:33:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:33:55,726 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:55,750 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,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:33:55,816 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-22 12:33:55,816 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-22 12:33:55,816 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-22 12:33:55,816 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-22 12:33:55,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:33:55,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:33:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:33:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:33:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:33:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:33:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:33:55,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:33:55,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:33:55,822 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,943 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:33:55,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:33:56,269 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:33:56,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:33:56,291 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:33:56,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:33:56 BoogieIcfgContainer [2022-07-22 12:33:56,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:33:56,299 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:33:56,299 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:33:56,303 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:33:56,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:56,305 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:56,306 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ec58f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:33:56, skipping insertion in model container [2022-07-22 12:33:56,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:56,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:33:55" (2/3) ... [2022-07-22 12:33:56,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ec58f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:33:56, skipping insertion in model container [2022-07-22 12:33:56,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:56,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:33:56" (3/3) ... [2022-07-22 12:33:56,309 INFO L322 chiAutomizerObserver]: Analyzing ICFG dekker.i [2022-07-22 12:33:56,494 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:33:56,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 106 transitions, 228 flow [2022-07-22 12:33:56,644 INFO L129 PetriNetUnfolder]: 13/102 cut-off events. [2022-07-22 12:33:56,644 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:33:56,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 102 events. 13/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-07-22 12:33:56,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 106 transitions, 228 flow [2022-07-22 12:33:56,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 102 transitions, 216 flow [2022-07-22 12:33:56,669 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:33:56,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 102 transitions, 216 flow [2022-07-22 12:33:56,686 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 102 transitions, 216 flow [2022-07-22 12:33:56,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 102 transitions, 216 flow [2022-07-22 12:33:56,724 INFO L129 PetriNetUnfolder]: 13/102 cut-off events. [2022-07-22 12:33:56,724 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:33:56,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 102 events. 13/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2022-07-22 12:33:56,728 INFO L116 LiptonReduction]: Number of co-enabled transitions 2000 [2022-07-22 12:33:59,274 INFO L131 LiptonReduction]: Checked pairs total: 6060 [2022-07-22 12:33:59,275 INFO L133 LiptonReduction]: Total number of compositions: 77 [2022-07-22 12:33:59,294 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:33:59,295 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:33:59,295 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:33:59,295 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:33:59,295 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:33:59,295 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:33:59,295 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:33:59,295 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:33:59,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:33:59,435 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 210 [2022-07-22 12:33:59,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:59,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:59,442 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:33:59,442 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:33:59,443 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:33:59,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 337 states, but on-demand construction may add more states [2022-07-22 12:33:59,464 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 210 [2022-07-22 12:33:59,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:59,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:59,465 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:33:59,465 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:33:59,471 INFO L748 eck$LassoCheckResult]: Stem: 101#[ULTIMATE.startENTRY]don't care [398] ULTIMATE.startENTRY-->L792-3: Formula: (let ((.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_#NULL.base_10| 0) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4) |v_#length_57|) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre4#1_37|))) (= 48 (select .cse0 0)) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (select |v_#length_58| 1) 2) (= v_~flag2~0_26 0) (= v_~flag1~0_32 0) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= (select |v_#length_58| 2) 9) (= v_~x~0_28 0) (= v_~turn~0_47 0) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1)) (= (select |v_#valid_89| 0) 0) (= (ite (and (<= v_~turn~0_47 1) (<= 0 v_~turn~0_47)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= |v_#NULL.offset_10| 0) (= |v_#pthreadsForks_42| |v_ULTIMATE.start_main_#t~pre4#1_37|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (< 0 |v_#StackHeapBarrier_20|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_42|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_46|, #length=|v_#length_58|} OutVars{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_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_19|, ~flag2~0=v_~flag2~0_26, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_17|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_20|, ~flag1~0=v_~flag1~0_32, #length=|v_#length_57|, ~turn~0=v_~turn~0_47, ~x~0=v_~x~0_28, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, 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, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 104#[L792-3]don't care [319] L792-3-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_16, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~t~0, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~f2~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 106#[thr1ENTRY, L792-4]don't care [329] thr1ENTRY-->L710: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|) (= v_~flag1~0_12 1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, ~flag1~0=v_~flag1~0_12, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, ~flag1~0, thr1Thread1of1ForFork1_~_.offset] 110#[L792-4, L710]don't care [291] L710-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_1, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 116#[L792-4, L736]don't care [2022-07-22 12:33:59,471 INFO L750 eck$LassoCheckResult]: Loop: 116#[L792-4, L736]don't care [377] L736-->L718: Formula: (and (= v_thr1Thread1of1ForFork1_~t~0_29 0) (= v_thr1Thread1of1ForFork1_~t~0_29 v_~turn~0_31) (<= 1 v_thr1Thread1of1ForFork1_~f2~0_15)) InVars {thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_15, ~turn~0=v_~turn~0_31} OutVars{thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_29, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_15, ~turn~0=v_~turn~0_31} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0] 128#[L792-4, L718]don't care [304] L718-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_7 v_~flag2~0_5) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_7, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 116#[L792-4, L736]don't care [2022-07-22 12:33:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 13097388, now seen corresponding path program 1 times [2022-07-22 12:33:59,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424019773] [2022-07-22 12:33:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,624 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 12952, now seen corresponding path program 1 times [2022-07-22 12:33:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022242480] [2022-07-22 12:33:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,700 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash -298300029, now seen corresponding path program 1 times [2022-07-22 12:33:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785075097] [2022-07-22 12:33:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:33:59,863 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:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:33:59,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785075097] [2022-07-22 12:33:59,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785075097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:33:59,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:33:59,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:33:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081354817] [2022-07-22 12:33:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:33:59,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:33:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:33:59,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:33:59,945 INFO L87 Difference]: Start difference. First operand currently 337 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:34:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:00,162 INFO L93 Difference]: Finished difference Result 468 states and 1221 transitions. [2022-07-22 12:34:00,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 468 states and 1221 transitions. [2022-07-22 12:34:00,176 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 234 [2022-07-22 12:34:00,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 468 states to 320 states and 873 transitions. [2022-07-22 12:34:00,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 320 [2022-07-22 12:34:00,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 320 [2022-07-22 12:34:00,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 320 states and 873 transitions. [2022-07-22 12:34:00,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:00,200 INFO L220 hiAutomatonCegarLoop]: Abstraction has 320 states and 873 transitions. [2022-07-22 12:34:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states and 873 transitions. [2022-07-22 12:34:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 260. [2022-07-22 12:34:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 260 states have (on average 2.773076923076923) internal successors, (721), 259 states have internal predecessors, (721), 0 states have call successors, (0), 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:34:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 721 transitions. [2022-07-22 12:34:00,270 INFO L242 hiAutomatonCegarLoop]: Abstraction has 260 states and 721 transitions. [2022-07-22 12:34:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:00,277 INFO L425 stractBuchiCegarLoop]: Abstraction has 260 states and 721 transitions. [2022-07-22 12:34:00,277 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:34:00,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 721 transitions. [2022-07-22 12:34:00,281 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 184 [2022-07-22 12:34:00,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:00,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:00,282 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:34:00,282 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:34:00,283 INFO L748 eck$LassoCheckResult]: Stem: 1767#[ULTIMATE.startENTRY]don't care [398] ULTIMATE.startENTRY-->L792-3: Formula: (let ((.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_#NULL.base_10| 0) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4) |v_#length_57|) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre4#1_37|))) (= 48 (select .cse0 0)) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (select |v_#length_58| 1) 2) (= v_~flag2~0_26 0) (= v_~flag1~0_32 0) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= (select |v_#length_58| 2) 9) (= v_~x~0_28 0) (= v_~turn~0_47 0) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1)) (= (select |v_#valid_89| 0) 0) (= (ite (and (<= v_~turn~0_47 1) (<= 0 v_~turn~0_47)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= |v_#NULL.offset_10| 0) (= |v_#pthreadsForks_42| |v_ULTIMATE.start_main_#t~pre4#1_37|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (< 0 |v_#StackHeapBarrier_20|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_42|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_46|, #length=|v_#length_58|} OutVars{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_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_19|, ~flag2~0=v_~flag2~0_26, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_17|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_20|, ~flag1~0=v_~flag1~0_32, #length=|v_#length_57|, ~turn~0=v_~turn~0_47, ~x~0=v_~x~0_28, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, 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, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1461#[L792-3]don't care [319] L792-3-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_16, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~t~0, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~f2~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 1297#[thr1ENTRY, L792-4]don't care [386] L792-4-->L793-3: Formula: (and (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_17|)) |v_#memory_int_31|) (= (select |v_#valid_64| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_37| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_ULTIMATE.start_main_#t~pre6#1_17| |v_#pthreadsForks_32|)) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, #length=|v_#length_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 1299#[thr1ENTRY, L793-3]don't care [316] L793-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_10, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_16, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~f1~0, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~t~1, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 1305#[thr1ENTRY, L793-4, thr2ENTRY]don't care [331] thr2ENTRY-->L751: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5) (= v_~flag2~0_8 1)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, ~flag2~0=v_~flag2~0_8, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, ~flag2~0, thr2Thread1of1ForFork0_~_.base] 1657#[thr1ENTRY, L793-4, L751]don't care [266] L751-->L777: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork0_~f1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0] 1483#[thr1ENTRY, L793-4, L777]don't care [2022-07-22 12:34:00,284 INFO L750 eck$LassoCheckResult]: Loop: 1483#[thr1ENTRY, L793-4, L777]don't care [356] L777-->L758: Formula: (and (<= 1 v_thr2Thread1of1ForFork0_~f1~0_15) (= v_~turn~0_23 v_thr2Thread1of1ForFork0_~t~1_25)) InVars {thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_15, ~turn~0=v_~turn~0_23} OutVars{thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_15, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_25, ~turn~0=v_~turn~0_23} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~t~1] 1481#[thr1ENTRY, L793-4, L758]don't care [325] L758-->L777: Formula: (and (= v_thr2Thread1of1ForFork0_~f1~0_11 v_~flag1~0_10) (= v_thr2Thread1of1ForFork0_~t~1_17 1)) InVars {~flag1~0=v_~flag1~0_10, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_17} OutVars{thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_11, ~flag1~0=v_~flag1~0_10, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_17} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0] 1483#[thr1ENTRY, L793-4, L777]don't care [2022-07-22 12:34:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -296579381, now seen corresponding path program 1 times [2022-07-22 12:34:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993049670] [2022-07-22 12:34:00,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,326 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 12322, now seen corresponding path program 1 times [2022-07-22 12:34:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467936475] [2022-07-22 12:34:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1544932244, now seen corresponding path program 1 times [2022-07-22 12:34:00,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897485017] [2022-07-22 12:34:00,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:00,450 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:34:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:00,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897485017] [2022-07-22 12:34:00,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897485017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:00,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:00,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:34:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064216340] [2022-07-22 12:34:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:00,471 INFO L87 Difference]: Start difference. First operand 260 states and 721 transitions. cyclomatic complexity: 493 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:34:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:00,567 INFO L93 Difference]: Finished difference Result 338 states and 907 transitions. [2022-07-22 12:34:00,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 907 transitions. [2022-07-22 12:34:00,573 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 212 [2022-07-22 12:34:00,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 314 states and 854 transitions. [2022-07-22 12:34:00,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2022-07-22 12:34:00,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 314 [2022-07-22 12:34:00,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 854 transitions. [2022-07-22 12:34:00,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:00,584 INFO L220 hiAutomatonCegarLoop]: Abstraction has 314 states and 854 transitions. [2022-07-22 12:34:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 854 transitions. [2022-07-22 12:34:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 250. [2022-07-22 12:34:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 250 states have (on average 2.76) internal successors, (690), 249 states have internal predecessors, (690), 0 states have call successors, (0), 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:34:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 690 transitions. [2022-07-22 12:34:00,625 INFO L242 hiAutomatonCegarLoop]: Abstraction has 250 states and 690 transitions. [2022-07-22 12:34:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:00,627 INFO L425 stractBuchiCegarLoop]: Abstraction has 250 states and 690 transitions. [2022-07-22 12:34:00,627 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:34:00,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 250 states and 690 transitions. [2022-07-22 12:34:00,630 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 168 [2022-07-22 12:34:00,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:00,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:00,631 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:00,631 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:34:00,632 INFO L748 eck$LassoCheckResult]: Stem: 2604#[ULTIMATE.startENTRY]don't care [398] ULTIMATE.startENTRY-->L792-3: Formula: (let ((.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_27| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= |v_#NULL.base_10| 0) (= (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_41| 4) |v_#length_57|) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_41| |v_ULTIMATE.start_main_#t~pre4#1_37|))) (= 48 (select .cse0 0)) (= |v_#pthreadsForks_41| (+ |v_#pthreadsForks_42| 1)) (= (select |v_#length_58| 1) 2) (= v_~flag2~0_26 0) (= v_~flag1~0_32 0) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_33| 0) (= (select |v_#length_58| 2) 9) (= v_~x~0_28 0) (= v_~turn~0_47 0) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41| 1)) (= (select |v_#valid_89| 0) 0) (= (ite (and (<= v_~turn~0_47 1) (<= 0 v_~turn~0_47)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_41|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_41| 0) (= |v_#NULL.offset_10| 0) (= |v_#pthreadsForks_42| |v_ULTIMATE.start_main_#t~pre4#1_37|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (< 0 |v_#StackHeapBarrier_20|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_41|) (= (select .cse0 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_42|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_46|, #length=|v_#length_58|} OutVars{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_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_33|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_26|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_37|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_41|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_27|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_19|, ~flag2~0=v_~flag2~0_26, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_17|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_20|, ~flag1~0=v_~flag1~0_32, #length=|v_#length_57|, ~turn~0=v_~turn~0_47, ~x~0=v_~x~0_28, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_41|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, 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, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2304#[L792-3]don't care [319] L792-3-->thr1ENTRY: Formula: (and (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_16, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~t~0, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~f2~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0] 2166#[thr1ENTRY, L792-4]don't care [386] L792-4-->L793-3: Formula: (and (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_17|)) |v_#memory_int_31|) (= (select |v_#valid_64| |v_ULTIMATE.start_main_~#t2~0#1.base_29|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_37| |v_ULTIMATE.start_main_~#t2~0#1.base_29|)) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_ULTIMATE.start_main_#t~pre6#1_17| |v_#pthreadsForks_32|)) InVars {#pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_32|, #length=|v_#length_37|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_31|, #length=|v_#length_37|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 2160#[thr1ENTRY, L793-3]don't care [329] thr1ENTRY-->L710: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_5| v_thr1Thread1of1ForFork1_~_.offset_5) (= v_thr1Thread1of1ForFork1_~_.base_5 |v_thr1Thread1of1ForFork1_#in~_.base_5|) (= v_~flag1~0_12 1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_5|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_5, ~flag1~0=v_~flag1~0_12, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_5|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, ~flag1~0, thr1Thread1of1ForFork1_~_.offset] 2162#[L710, L793-3]don't care [316] L793-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork0_thidvar0_2) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_~f1~0=v_thr2Thread1of1ForFork0_~f1~0_10, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~t~1=v_thr2Thread1of1ForFork0_~t~1_16, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~f1~0, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~t~1, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 2426#[L710, L793-4, thr2ENTRY]don't care [331] thr2ENTRY-->L751: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5) (= v_~flag2~0_8 1)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_5, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_5|, ~flag2~0=v_~flag2~0_8, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, ~flag2~0, thr2Thread1of1ForFork0_~_.base] 2428#[L710, L793-4, L751]don't care [291] L710-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_1 v_~flag2~0_6) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_1, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 2600#[L736, L793-4, L751]don't care [2022-07-22 12:34:00,632 INFO L750 eck$LassoCheckResult]: Loop: 2600#[L736, L793-4, L751]don't care [377] L736-->L718: Formula: (and (= v_thr1Thread1of1ForFork1_~t~0_29 0) (= v_thr1Thread1of1ForFork1_~t~0_29 v_~turn~0_31) (<= 1 v_thr1Thread1of1ForFork1_~f2~0_15)) InVars {thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_15, ~turn~0=v_~turn~0_31} OutVars{thr1Thread1of1ForFork1_~t~0=v_thr1Thread1of1ForFork1_~t~0_29, thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_15, ~turn~0=v_~turn~0_31} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0] 2320#[L751, L793-4, L718]don't care [304] L718-->L736: Formula: (= v_thr1Thread1of1ForFork1_~f2~0_7 v_~flag2~0_5) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0=v_thr1Thread1of1ForFork1_~f2~0_7, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0] 2600#[L736, L793-4, L751]don't care [2022-07-22 12:34:00,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash -603651045, now seen corresponding path program 1 times [2022-07-22 12:34:00,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949810779] [2022-07-22 12:34:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash 12952, now seen corresponding path program 2 times [2022-07-22 12:34:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187022734] [2022-07-22 12:34:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:00,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,735 INFO L85 PathProgramCache]: Analyzing trace with hash -288057294, now seen corresponding path program 1 times [2022-07-22 12:34:00,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97482348] [2022-07-22 12:34:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:01,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:34:01 BoogieIcfgContainer [2022-07-22 12:34:01,634 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:34:01,641 INFO L158 Benchmark]: Toolchain (without parser) took 6937.84ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 123.8MB in the beginning and 125.2MB in the end (delta: -1.3MB). Peak memory consumption was 82.2MB. Max. memory is 8.0GB. [2022-07-22 12:34:01,642 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 125.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:34:01,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 855.36ms. Allocated memory is still 151.0MB. Free memory was 123.6MB in the beginning and 103.9MB in the end (delta: 19.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-07-22 12:34:01,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.99ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 101.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:34:01,647 INFO L158 Benchmark]: Boogie Preprocessor took 32.72ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 100.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:01,654 INFO L158 Benchmark]: RCFGBuilder took 614.84ms. Allocated memory is still 151.0MB. Free memory was 100.5MB in the beginning and 122.9MB in the end (delta: -22.4MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:01,655 INFO L158 Benchmark]: BuchiAutomizer took 5335.83ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 122.9MB in the beginning and 125.2MB in the end (delta: -2.3MB). Peak memory consumption was 80.6MB. Max. memory is 8.0GB. [2022-07-22 12:34:01,665 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.26ms. Allocated memory is still 125.8MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 855.36ms. Allocated memory is still 151.0MB. Free memory was 123.6MB in the beginning and 103.9MB in the end (delta: 19.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.99ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 101.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.72ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 100.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 614.84ms. Allocated memory is still 151.0MB. Free memory was 100.5MB in the beginning and 122.9MB in the end (delta: -22.4MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 5335.83ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 122.9MB in the beginning and 125.2MB in the end (delta: -2.3MB). Peak memory consumption was 80.6MB. 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 250 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 124 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, 115 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 212 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 35 mSDtfsCounter, 212 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.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 714]: 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 {\old(cond)=1, \result={0:0}, \result=0, \result={0:0}, _={0:0}, _={0:0}, _={0:0}, _={0:0}, cond=1, f1=0, f2=1, flag1=1, flag2=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@612414a5 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@619bacca in0,-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1c5e4c9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@22b0429c=0, t=0, t=0, t1={22926:0}, t2={22927:0}, turn=0, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 714]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L704] 0 int flag1 = 0, flag2 = 0; [L705] 0 int turn; [L706] 0 int x; [L790] 0 pthread_t t1, t2; [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L709] 1 flag1 = 1 [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L750] 2 flag2 = 1 [L712] 1 int f2 = flag2; Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE !(t != 0) [L735] f2 = flag2 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 96 PlacesBefore, 38 PlacesAfterwards, 102 TransitionsBefore, 38 TransitionsAfterwards, 2000 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 10 ConcurrentYvCompositions, 6 ChoiceCompositions, 77 TotalNumberOfCompositions, 6060 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3012, positive: 2769, positive conditional: 0, positive unconditional: 2769, negative: 243, negative conditional: 0, negative unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1012, positive: 978, positive conditional: 0, positive unconditional: 978, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3012, positive: 1791, positive conditional: 0, positive unconditional: 1791, negative: 209, negative conditional: 0, negative unconditional: 209, unknown: 1012, unknown conditional: 0, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 175, Positive conditional cache size: 0, Positive unconditional cache size: 175, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:34:01,773 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...