/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/lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:33:52,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:33:52,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:33:52,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:33:52,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:33:52,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:33:52,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:33:52,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:33:52,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:33:52,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:33:52,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:33:52,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:33:52,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:33:52,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:33:52,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:33:52,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:33:52,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:33:52,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:33:52,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:33:52,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:33:52,590 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:33:52,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:33:52,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:33:52,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:33:52,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:33:52,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:33:52,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:33:52,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:33:52,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:33:52,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:33:52,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:33:52,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:33:52,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:33:52,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:33:52,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:33:52,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:33:52,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:33:52,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:33:52,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:33:52,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:33:52,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:33:52,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:33:52,626 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,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:33:52,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:33:52,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:33:52,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:33:52,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:33:52,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:33:52,660 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:33:52,660 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:33:52,660 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:33:52,660 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:33:52,661 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:33:52,661 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:33:52,661 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:33:52,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:33:52,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:33:52,662 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:33:52,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:33:52,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:33:52,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:33:52,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:33:52,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:33:52,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:33:52,663 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:33:52,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:33:52,663 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:33:52,664 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:33:52,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:33:52,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:33:52,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:33:52,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:33:52,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:33:52,665 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:33:52,666 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:33:52,666 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,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:33:53,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:33:53,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:33:53,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:33:53,080 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:33:53,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/lamport.i [2022-07-22 12:33:53,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d8682c/d5f4720d8d1648b0a11468167561d025/FLAG6b2dd2417 [2022-07-22 12:33:53,960 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:33:53,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i [2022-07-22 12:33:53,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d8682c/d5f4720d8d1648b0a11468167561d025/FLAG6b2dd2417 [2022-07-22 12:33:54,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d8682c/d5f4720d8d1648b0a11468167561d025 [2022-07-22 12:33:54,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:33:54,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:33:54,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:33:54,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:33:54,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:33:54,157 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,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f0bc8 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,158 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,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:33:54,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:33:54,440 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:33:54,732 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/lamport.i[32156,32169] [2022-07-22 12:33:54,742 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/lamport.i[34083,34096] [2022-07-22 12:33:54,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:33:54,775 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:33:54,807 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:33:54,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/lamport.i[32156,32169] [2022-07-22 12:33:54,875 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/lamport.i[34083,34096] [2022-07-22 12:33:54,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:33:54,961 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:33:54,961 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,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:33:54,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:33:54,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:33:54,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:33:54,973 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:55,015 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:55,053 INFO L137 Inliner]: procedures = 171, calls = 83, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-07-22 12:33:55,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:33:55,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:33:55,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:33:55,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:33:55,066 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:55,067 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:55,087 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:55,087 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:55,103 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:55,122 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:55,129 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:55,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:33:55,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:33:55,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:33:55,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:33:55,141 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:55,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:33:55,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:33:55,191 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,210 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,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:33:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-22 12:33:55,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-22 12:33:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-22 12:33:55,259 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-22 12:33:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:33:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:33:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:33:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:33:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:33:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:33:55,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:33:55,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:33:55,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:33:55,263 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,384 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:33:55,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:33:55,675 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:33:55,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:33:55,685 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 12:33:55,689 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,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:33:55,690 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:33:55,691 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:33:55,695 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:33:55,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:55,697 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,699 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e04d9c2 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,699 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:55,699 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,700 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e04d9c2 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,700 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:33:55,700 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,702 INFO L322 chiAutomizerObserver]: Analyzing ICFG lamport.i [2022-07-22 12:33:55,879 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:33:55,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 133 transitions, 282 flow [2022-07-22 12:33:55,995 INFO L129 PetriNetUnfolder]: 24/129 cut-off events. [2022-07-22 12:33:55,995 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:33:56,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 24/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 243 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 95. Up to 5 conditions per place. [2022-07-22 12:33:56,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 133 transitions, 282 flow [2022-07-22 12:33:56,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 129 transitions, 270 flow [2022-07-22 12:33:56,028 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:33:56,042 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 129 transitions, 270 flow [2022-07-22 12:33:56,047 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 129 transitions, 270 flow [2022-07-22 12:33:56,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 129 transitions, 270 flow [2022-07-22 12:33:56,083 INFO L129 PetriNetUnfolder]: 24/129 cut-off events. [2022-07-22 12:33:56,083 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:33:56,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 24/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 234 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 95. Up to 5 conditions per place. [2022-07-22 12:33:56,091 INFO L116 LiptonReduction]: Number of co-enabled transitions 4788 [2022-07-22 12:33:58,440 INFO L131 LiptonReduction]: Checked pairs total: 16596 [2022-07-22 12:33:58,441 INFO L133 LiptonReduction]: Total number of compositions: 80 [2022-07-22 12:33:58,465 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:33:58,465 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:33:58,465 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:33:58,465 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:33:58,465 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:33:58,466 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:33:58,466 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:33:58,466 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:33:58,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:33:58,688 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 728 [2022-07-22 12:33:58,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:58,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:58,698 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:33:58,698 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:33:58,698 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:33:58,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 841 states, but on-demand construction may add more states [2022-07-22 12:33:58,735 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 728 [2022-07-22 12:33:58,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:58,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:58,736 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:33:58,736 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:33:58,743 INFO L748 eck$LassoCheckResult]: Stem: 117#[ULTIMATE.startENTRY]don't care [531] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= 48 (select .cse1 0)) (= v_~y~0_50 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= v_~b1~0_22 0) (= 2 (select |v_#length_56| 1)) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= v_~b2~0_22 0) (= v_~x~0_14 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (< 0 |v_#StackHeapBarrier_24|) (= v_~X~0_32 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_22, 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_32, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_50, ~b1~0=v_~b1~0_22, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, 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, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 120#[L845-2]don't care [449] L845-2-->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_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, 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, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 122#[thr1ENTRY, L845-3]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 124#[L753-1, L845-3]don't care [2022-07-22 12:33:58,743 INFO L750 eck$LassoCheckResult]: Loop: 124#[L753-1, L845-3]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 130#[L845-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 140#[L710, L845-3]don't care [414] L710-->L713: Formula: (= v_~y~0_12 v_thr1Thread1of1ForFork1_~y1~0_1) InVars {~y~0=v_~y~0_12} OutVars{~y~0=v_~y~0_12, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 162#[L845-3, L713]don't care [454] L713-->L717: Formula: (and (= v_~b1~0_8 0) (not (= v_thr1Thread1of1ForFork1_~y1~0_35 0))) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35, ~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 202#[L845-3, L717]don't care [422] L717-->L724: Formula: (= v_~y~0_13 v_thr1Thread1of1ForFork1_~y1~0_7) InVars {~y~0=v_~y~0_13} OutVars{~y~0=v_~y~0_13, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 268#[L845-3, L724]don't care [506] L724-->L753-1: Formula: (= v_thr1Thread1of1ForFork1_~y1~0_In_3 0) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_In_3} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_In_3} AuxVars[] AssignedVars[] 124#[L753-1, L845-3]don't care [2022-07-22 12:33:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash 554482, now seen corresponding path program 1 times [2022-07-22 12:33:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:58,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400027171] [2022-07-22 12:33:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:58,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1507103438, now seen corresponding path program 1 times [2022-07-22 12:33:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:58,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409668303] [2022-07-22 12:33:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:33:59,125 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,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:33:59,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409668303] [2022-07-22 12:33:59,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409668303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:33:59,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:33:59,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:33:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454464873] [2022-07-22 12:33:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:33:59,137 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-07-22 12:33:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:33:59,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:33:59,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:33:59,176 INFO L87 Difference]: Start difference. First operand currently 841 states, but on-demand construction may add more states Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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:33:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:33:59,580 INFO L93 Difference]: Finished difference Result 1646 states and 4413 transitions. [2022-07-22 12:33:59,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1646 states and 4413 transitions. [2022-07-22 12:33:59,607 INFO L131 ngComponentsAnalysis]: Automaton has 324 accepting balls. 764 [2022-07-22 12:33:59,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1646 states to 1432 states and 3846 transitions. [2022-07-22 12:33:59,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1432 [2022-07-22 12:33:59,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1432 [2022-07-22 12:33:59,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1432 states and 3846 transitions. [2022-07-22 12:33:59,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:33:59,666 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1432 states and 3846 transitions. [2022-07-22 12:33:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states and 3846 transitions. [2022-07-22 12:33:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 978. [2022-07-22 12:33:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 978 states have (on average 2.7208588957055215) internal successors, (2661), 977 states have internal predecessors, (2661), 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,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 2661 transitions. [2022-07-22 12:33:59,799 INFO L242 hiAutomatonCegarLoop]: Abstraction has 978 states and 2661 transitions. [2022-07-22 12:33:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:33:59,807 INFO L425 stractBuchiCegarLoop]: Abstraction has 978 states and 2661 transitions. [2022-07-22 12:33:59,811 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:33:59,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 978 states and 2661 transitions. [2022-07-22 12:33:59,822 INFO L131 ngComponentsAnalysis]: Automaton has 234 accepting balls. 524 [2022-07-22 12:33:59,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:33:59,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:33:59,824 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:33:59,824 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:33:59,825 INFO L748 eck$LassoCheckResult]: Stem: 5148#[ULTIMATE.startENTRY]don't care [531] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= 48 (select .cse1 0)) (= v_~y~0_50 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= v_~b1~0_22 0) (= 2 (select |v_#length_56| 1)) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= v_~b2~0_22 0) (= v_~x~0_14 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (< 0 |v_#StackHeapBarrier_24|) (= v_~X~0_32 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_22, 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_32, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_50, ~b1~0=v_~b1~0_22, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, 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, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 5150#[L845-2]don't care [449] L845-2-->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_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, 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, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 4374#[thr1ENTRY, L845-3]don't care [524] L845-3-->L846-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_22|) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_21|, 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_58|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 4322#[thr1ENTRY, L846-3]don't care [446] L846-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_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, 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_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 4326#[thr1ENTRY, thr2ENTRY, L846-4]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) 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|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 5118#[thr1ENTRY, L823-1, L846-4]don't care [2022-07-22 12:33:59,829 INFO L750 eck$LassoCheckResult]: Loop: 5118#[thr1ENTRY, L823-1, L846-4]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_14 1) InVars {} OutVars{~b2~0=v_~b2~0_14} AuxVars[] AssignedVars[~b2~0] 5184#[thr1ENTRY, L777, L846-4]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 5178#[thr1ENTRY, L780, L846-4]don't care [372] L780-->L783: Formula: (= v_~y~0_2 v_thr2Thread1of1ForFork0_~y2~0_1) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 5180#[thr1ENTRY, L783, L846-4]don't care [483] L783-->L787: Formula: (and (= v_~b2~0_10 0) (not (= v_thr2Thread1of1ForFork0_~y2~0_43 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_43} OutVars{~b2~0=v_~b2~0_10, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_43} AuxVars[] AssignedVars[~b2~0] 5204#[thr1ENTRY, L787, L846-4]don't care [380] L787-->L794: Formula: (= v_~y~0_3 v_thr2Thread1of1ForFork0_~y2~0_7) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 5194#[thr1ENTRY, L794, L846-4]don't care [505] L794-->L823-1: Formula: (= v_thr2Thread1of1ForFork0_~y2~0_In_1 0) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_In_1} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_In_1} AuxVars[] AssignedVars[] 5118#[thr1ENTRY, L823-1, L846-4]don't care [2022-07-22 12:33:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,830 INFO L85 PathProgramCache]: Analyzing trace with hash 532912819, now seen corresponding path program 1 times [2022-07-22 12:33:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895163183] [2022-07-22 12:33:59,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:33:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:33:59,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:33:59,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:33:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1568193752, now seen corresponding path program 1 times [2022-07-22 12:33:59,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:33:59,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790051959] [2022-07-22 12:33:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:33:59,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:33:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:00,003 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,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:00,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790051959] [2022-07-22 12:34:00,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790051959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:00,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:00,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:34:00,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990560001] [2022-07-22 12:34:00,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:00,006 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-07-22 12:34:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:34:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:34:00,007 INFO L87 Difference]: Start difference. First operand 978 states and 2661 transitions. cyclomatic complexity: 1917 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:00,303 INFO L93 Difference]: Finished difference Result 1314 states and 3423 transitions. [2022-07-22 12:34:00,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1314 states and 3423 transitions. [2022-07-22 12:34:00,320 INFO L131 ngComponentsAnalysis]: Automaton has 332 accepting balls. 332 [2022-07-22 12:34:00,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1314 states to 1314 states and 3423 transitions. [2022-07-22 12:34:00,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1314 [2022-07-22 12:34:00,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1314 [2022-07-22 12:34:00,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1314 states and 3423 transitions. [2022-07-22 12:34:00,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:00,343 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1314 states and 3423 transitions. [2022-07-22 12:34:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states and 3423 transitions. [2022-07-22 12:34:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 900. [2022-07-22 12:34:00,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 900 states have (on average 2.6366666666666667) internal successors, (2373), 899 states have internal predecessors, (2373), 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,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2373 transitions. [2022-07-22 12:34:00,382 INFO L242 hiAutomatonCegarLoop]: Abstraction has 900 states and 2373 transitions. [2022-07-22 12:34:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:34:00,384 INFO L425 stractBuchiCegarLoop]: Abstraction has 900 states and 2373 transitions. [2022-07-22 12:34:00,384 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:34:00,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 900 states and 2373 transitions. [2022-07-22 12:34:00,393 INFO L131 ngComponentsAnalysis]: Automaton has 240 accepting balls. 240 [2022-07-22 12:34:00,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:00,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:00,394 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:00,394 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:00,395 INFO L748 eck$LassoCheckResult]: Stem: 8378#[ULTIMATE.startENTRY]don't care [531] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= 48 (select .cse1 0)) (= v_~y~0_50 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= v_~b1~0_22 0) (= 2 (select |v_#length_56| 1)) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= v_~b2~0_22 0) (= v_~x~0_14 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (< 0 |v_#StackHeapBarrier_24|) (= v_~X~0_32 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_22, 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_32, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_50, ~b1~0=v_~b1~0_22, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, 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, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 8380#[L845-2]don't care [449] L845-2-->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_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, 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, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 7650#[thr1ENTRY, L845-3]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 7652#[L753-1, L845-3]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 8010#[L845-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 7678#[L710, L845-3]don't care [414] L710-->L713: Formula: (= v_~y~0_12 v_thr1Thread1of1ForFork1_~y1~0_1) InVars {~y~0=v_~y~0_12} OutVars{~y~0=v_~y~0_12, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 7682#[L845-3, L713]don't care [454] L713-->L717: Formula: (and (= v_~b1~0_8 0) (not (= v_thr1Thread1of1ForFork1_~y1~0_35 0))) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_35, ~b1~0=v_~b1~0_8} AuxVars[] AssignedVars[~b1~0] 8232#[L845-3, L717]don't care [422] L717-->L724: Formula: (= v_~y~0_13 v_thr1Thread1of1ForFork1_~y1~0_7) InVars {~y~0=v_~y~0_13} OutVars{~y~0=v_~y~0_13, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 8234#[L845-3, L724]don't care [2022-07-22 12:34:00,395 INFO L750 eck$LassoCheckResult]: Loop: 8234#[L845-3, L724]don't care [465] L724-->L724: Formula: (and (= v_thr1Thread1of1ForFork1_~y1~0_37 v_~y~0_24) (not (= v_thr1Thread1of1ForFork1_~y1~0_38 0))) InVars {thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_38, ~y~0=v_~y~0_24} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_37, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 8234#[L845-3, L724]don't care [2022-07-22 12:34:00,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash 585407835, now seen corresponding path program 1 times [2022-07-22 12:34:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097799557] [2022-07-22 12:34:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:00,486 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,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:00,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097799557] [2022-07-22 12:34:00,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097799557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:00,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:00,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:34:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682934277] [2022-07-22 12:34:00,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:00,490 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:34:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,490 INFO L85 PathProgramCache]: Analyzing trace with hash 496, now seen corresponding path program 1 times [2022-07-22 12:34:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385874374] [2022-07-22 12:34:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:00,538 INFO L87 Difference]: Start difference. First operand 900 states and 2373 transitions. cyclomatic complexity: 1713 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,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:00,738 INFO L93 Difference]: Finished difference Result 1126 states and 2833 transitions. [2022-07-22 12:34:00,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1126 states and 2833 transitions. [2022-07-22 12:34:00,777 INFO L131 ngComponentsAnalysis]: Automaton has 266 accepting balls. 266 [2022-07-22 12:34:00,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1126 states to 1108 states and 2794 transitions. [2022-07-22 12:34:00,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1108 [2022-07-22 12:34:00,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1108 [2022-07-22 12:34:00,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1108 states and 2794 transitions. [2022-07-22 12:34:00,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:00,818 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1108 states and 2794 transitions. [2022-07-22 12:34:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states and 2794 transitions. [2022-07-22 12:34:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 858. [2022-07-22 12:34:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 858 states have (on average 2.599067599067599) internal successors, (2230), 857 states have internal predecessors, (2230), 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,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2230 transitions. [2022-07-22 12:34:00,913 INFO L242 hiAutomatonCegarLoop]: Abstraction has 858 states and 2230 transitions. [2022-07-22 12:34:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:00,915 INFO L425 stractBuchiCegarLoop]: Abstraction has 858 states and 2230 transitions. [2022-07-22 12:34:00,915 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:34:00,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 858 states and 2230 transitions. [2022-07-22 12:34:00,923 INFO L131 ngComponentsAnalysis]: Automaton has 218 accepting balls. 218 [2022-07-22 12:34:00,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:00,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:00,924 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:00,924 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:00,925 INFO L748 eck$LassoCheckResult]: Stem: 11255#[ULTIMATE.startENTRY]don't care [531] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= 48 (select .cse1 0)) (= v_~y~0_50 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= v_~b1~0_22 0) (= 2 (select |v_#length_56| 1)) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= v_~b2~0_22 0) (= v_~x~0_14 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (< 0 |v_#StackHeapBarrier_24|) (= v_~X~0_32 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_22, 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_32, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_50, ~b1~0=v_~b1~0_22, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, 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, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 11257#[L845-2]don't care [449] L845-2-->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_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, 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, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 10547#[thr1ENTRY, L845-3]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 10549#[L753-1, L845-3]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 10893#[L845-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 10569#[L710, L845-3]don't care [466] L710-->L728: Formula: (and (= v_thr1Thread1of1ForFork1_~y1~0_41 0) (= v_thr1Thread1of1ForFork1_~y1~0_41 v_~y~0_26)) InVars {~y~0=v_~y~0_26} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_41, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 10571#[L845-3, L728]don't care [420] L728-->L730: Formula: (= v_~y~0_16 1) InVars {} OutVars{~y~0=v_~y~0_16} AuxVars[] AssignedVars[~y~0] 10875#[L730, L845-3]don't care [463] L730-->L735: Formula: (and (not (= v_thr1Thread1of1ForFork1_~x1~0_9 1)) (= v_thr1Thread1of1ForFork1_~x1~0_9 v_~x~0_6)) InVars {~x~0=v_~x~0_6} OutVars{~x~0=v_~x~0_6, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_9} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~x1~0] 11095#[L845-3, L735]don't care [430] L735-->L737: Formula: (= v_~b1~0_3 0) InVars {} OutVars{~b1~0=v_~b1~0_3} AuxVars[] AssignedVars[~b1~0] 11227#[L845-3, L737]don't care [431] L737-->L744: Formula: (= v_~b2~0_5 v_thr1Thread1of1ForFork1_~b21~0_1) InVars {~b2~0=v_~b2~0_5} OutVars{~b2~0=v_~b2~0_5, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0] 11049#[L845-3, L744]don't care [2022-07-22 12:34:00,925 INFO L750 eck$LassoCheckResult]: Loop: 11049#[L845-3, L744]don't care [472] L744-->L744: Formula: (and (<= 1 v_thr1Thread1of1ForFork1_~b21~0_12) (= v_thr1Thread1of1ForFork1_~b21~0_11 v_~b2~0_8)) InVars {~b2~0=v_~b2~0_8, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_12} OutVars{~b2~0=v_~b2~0_8, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_11} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~b21~0] 11049#[L845-3, L744]don't care [2022-07-22 12:34:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash -16722981, now seen corresponding path program 1 times [2022-07-22 12:34:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668472950] [2022-07-22 12:34:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:00,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:34:00,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:00,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668472950] [2022-07-22 12:34:00,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668472950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:00,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:00,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:34:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028778787] [2022-07-22 12:34:00,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:00,959 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:34:00,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash 503, now seen corresponding path program 1 times [2022-07-22 12:34:00,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:00,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495655181] [2022-07-22 12:34:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:00,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:00,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:00,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:34:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:34:00,984 INFO L87 Difference]: Start difference. First operand 858 states and 2230 transitions. cyclomatic complexity: 1590 Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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:34:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:01,073 INFO L93 Difference]: Finished difference Result 1234 states and 3103 transitions. [2022-07-22 12:34:01,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1234 states and 3103 transitions. [2022-07-22 12:34:01,088 INFO L131 ngComponentsAnalysis]: Automaton has 290 accepting balls. 290 [2022-07-22 12:34:01,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1234 states to 1102 states and 2793 transitions. [2022-07-22 12:34:01,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1102 [2022-07-22 12:34:01,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1102 [2022-07-22 12:34:01,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1102 states and 2793 transitions. [2022-07-22 12:34:01,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:01,106 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1102 states and 2793 transitions. [2022-07-22 12:34:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states and 2793 transitions. [2022-07-22 12:34:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 822. [2022-07-22 12:34:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 822 states have (on average 2.602189781021898) internal successors, (2139), 821 states have internal predecessors, (2139), 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:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 2139 transitions. [2022-07-22 12:34:01,136 INFO L242 hiAutomatonCegarLoop]: Abstraction has 822 states and 2139 transitions. [2022-07-22 12:34:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:34:01,137 INFO L425 stractBuchiCegarLoop]: Abstraction has 822 states and 2139 transitions. [2022-07-22 12:34:01,137 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:34:01,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 822 states and 2139 transitions. [2022-07-22 12:34:01,145 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 216 [2022-07-22 12:34:01,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:01,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:01,146 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:01,146 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:01,147 INFO L748 eck$LassoCheckResult]: Stem: 14035#[ULTIMATE.startENTRY]don't care [531] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= 48 (select .cse1 0)) (= v_~y~0_50 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= v_~b1~0_22 0) (= 2 (select |v_#length_56| 1)) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= v_~b2~0_22 0) (= v_~x~0_14 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (< 0 |v_#StackHeapBarrier_24|) (= v_~X~0_32 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_22, 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_32, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_50, ~b1~0=v_~b1~0_22, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, 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, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 14037#[L845-2]don't care [449] L845-2-->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_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, 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, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 13399#[thr1ENTRY, L845-3]don't care [524] L845-3-->L846-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_22|) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_21|, 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_58|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 13359#[thr1ENTRY, L846-3]don't care [446] L846-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_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, 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_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 13363#[thr1ENTRY, thr2ENTRY, L846-4]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) 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|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 14011#[thr1ENTRY, L823-1, L846-4]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_14 1) InVars {} OutVars{~b2~0=v_~b2~0_14} AuxVars[] AssignedVars[~b2~0] 12873#[thr1ENTRY, L777, L846-4]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 12877#[thr1ENTRY, L780, L846-4]don't care [372] L780-->L783: Formula: (= v_~y~0_2 v_thr2Thread1of1ForFork0_~y2~0_1) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 13611#[thr1ENTRY, L783, L846-4]don't care [483] L783-->L787: Formula: (and (= v_~b2~0_10 0) (not (= v_thr2Thread1of1ForFork0_~y2~0_43 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_43} OutVars{~b2~0=v_~b2~0_10, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_43} AuxVars[] AssignedVars[~b2~0] 13615#[thr1ENTRY, L787, L846-4]don't care [380] L787-->L794: Formula: (= v_~y~0_3 v_thr2Thread1of1ForFork0_~y2~0_7) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 12659#[thr1ENTRY, L794, L846-4]don't care [2022-07-22 12:34:01,147 INFO L750 eck$LassoCheckResult]: Loop: 12659#[thr1ENTRY, L794, L846-4]don't care [476] L794-->L794: Formula: (and (= v_thr2Thread1of1ForFork0_~y2~0_31 v_~y~0_32) (not (= v_thr2Thread1of1ForFork0_~y2~0_32 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_32, ~y~0=v_~y~0_32} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_31, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 12659#[thr1ENTRY, L794, L846-4]don't care [2022-07-22 12:34:01,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1513070975, now seen corresponding path program 1 times [2022-07-22 12:34:01,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:01,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736221428] [2022-07-22 12:34:01,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:01,184 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:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:01,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736221428] [2022-07-22 12:34:01,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736221428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:01,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:01,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:34:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217703263] [2022-07-22 12:34:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:01,186 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:34:01,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash 507, now seen corresponding path program 1 times [2022-07-22 12:34:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:01,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011955063] [2022-07-22 12:34:01,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:01,206 INFO L87 Difference]: Start difference. First operand 822 states and 2139 transitions. cyclomatic complexity: 1533 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:34:01,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:01,332 INFO L93 Difference]: Finished difference Result 992 states and 2483 transitions. [2022-07-22 12:34:01,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 2483 transitions. [2022-07-22 12:34:01,342 INFO L131 ngComponentsAnalysis]: Automaton has 236 accepting balls. 236 [2022-07-22 12:34:01,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 960 states and 2411 transitions. [2022-07-22 12:34:01,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 960 [2022-07-22 12:34:01,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 960 [2022-07-22 12:34:01,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 960 states and 2411 transitions. [2022-07-22 12:34:01,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:01,358 INFO L220 hiAutomatonCegarLoop]: Abstraction has 960 states and 2411 transitions. [2022-07-22 12:34:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states and 2411 transitions. [2022-07-22 12:34:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 776. [2022-07-22 12:34:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 776 states have (on average 2.5657216494845363) internal successors, (1991), 775 states have internal predecessors, (1991), 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:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1991 transitions. [2022-07-22 12:34:01,387 INFO L242 hiAutomatonCegarLoop]: Abstraction has 776 states and 1991 transitions. [2022-07-22 12:34:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:01,391 INFO L425 stractBuchiCegarLoop]: Abstraction has 776 states and 1991 transitions. [2022-07-22 12:34:01,391 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:34:01,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 776 states and 1991 transitions. [2022-07-22 12:34:01,398 INFO L131 ngComponentsAnalysis]: Automaton has 200 accepting balls. 200 [2022-07-22 12:34:01,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:01,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:01,399 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:01,399 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:01,402 INFO L748 eck$LassoCheckResult]: Stem: 16636#[ULTIMATE.startENTRY]don't care [531] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= 48 (select .cse1 0)) (= v_~y~0_50 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= v_~b1~0_22 0) (= 2 (select |v_#length_56| 1)) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= v_~b2~0_22 0) (= v_~x~0_14 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (< 0 |v_#StackHeapBarrier_24|) (= v_~X~0_32 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_22, 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_32, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_50, ~b1~0=v_~b1~0_22, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, 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, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 16638#[L845-2]don't care [449] L845-2-->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_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, 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, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 16002#[thr1ENTRY, L845-3]don't care [524] L845-3-->L846-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_22|) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_21|, 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_58|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 15962#[thr1ENTRY, L846-3]don't care [446] L846-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_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, 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_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 15966#[thr1ENTRY, thr2ENTRY, L846-4]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) 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|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 16608#[thr1ENTRY, L823-1, L846-4]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_14 1) InVars {} OutVars{~b2~0=v_~b2~0_14} AuxVars[] AssignedVars[~b2~0] 15500#[thr1ENTRY, L777, L846-4]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 15504#[thr1ENTRY, L780, L846-4]don't care [494] L780-->L798: Formula: (and (= v_thr2Thread1of1ForFork0_~y2~0_51 0) (= v_thr2Thread1of1ForFork0_~y2~0_51 v_~y~0_44)) InVars {~y~0=v_~y~0_44} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_51, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 16576#[thr1ENTRY, L798, L846-4]don't care [378] L798-->L800: Formula: (= 2 v_~y~0_6) InVars {} OutVars{~y~0=v_~y~0_6} AuxVars[] AssignedVars[~y~0] 15840#[thr1ENTRY, L800, L846-4]don't care [381] L800-->L803: Formula: (= v_~x~0_2 v_thr2Thread1of1ForFork0_~x2~0_1) InVars {~x~0=v_~x~0_2} OutVars{thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_1, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~x2~0] 15846#[thr1ENTRY, L803, L846-4]don't care [484] L803-->L807: Formula: (and (= v_~b2~0_12 0) (not (= 2 v_thr2Thread1of1ForFork0_~x2~0_9))) InVars {thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_9} OutVars{~b2~0=v_~b2~0_12, thr2Thread1of1ForFork0_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_9} AuxVars[] AssignedVars[~b2~0] 16594#[thr1ENTRY, L807, L846-4]don't care [389] L807-->L814: Formula: (= v_~b1~0_1 v_thr2Thread1of1ForFork0_~b12~0_1) InVars {~b1~0=v_~b1~0_1} OutVars{~b1~0=v_~b1~0_1, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0] 16456#[thr1ENTRY, L814, L846-4]don't care [2022-07-22 12:34:01,402 INFO L750 eck$LassoCheckResult]: Loop: 16456#[thr1ENTRY, L814, L846-4]don't care [461] L814-->L814: Formula: (and (<= 1 v_thr2Thread1of1ForFork0_~b12~0_12) (= v_thr2Thread1of1ForFork0_~b12~0_11 v_~b1~0_12)) InVars {thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_12, ~b1~0=v_~b1~0_12} OutVars{thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_11, ~b1~0=v_~b1~0_12} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~b12~0] 16456#[thr1ENTRY, L814, L846-4]don't care [2022-07-22 12:34:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1823148508, now seen corresponding path program 1 times [2022-07-22 12:34:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:01,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034422406] [2022-07-22 12:34:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:01,465 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:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:01,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034422406] [2022-07-22 12:34:01,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034422406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:01,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:01,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:34:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967222862] [2022-07-22 12:34:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:01,467 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:34:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:01,468 INFO L85 PathProgramCache]: Analyzing trace with hash 492, now seen corresponding path program 1 times [2022-07-22 12:34:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:01,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555424791] [2022-07-22 12:34:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,477 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:01,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:01,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:01,495 INFO L87 Difference]: Start difference. First operand 776 states and 1991 transitions. cyclomatic complexity: 1415 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:01,613 INFO L93 Difference]: Finished difference Result 870 states and 2044 transitions. [2022-07-22 12:34:01,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 870 states and 2044 transitions. [2022-07-22 12:34:01,621 INFO L131 ngComponentsAnalysis]: Automaton has 174 accepting balls. 174 [2022-07-22 12:34:01,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 870 states to 706 states and 1689 transitions. [2022-07-22 12:34:01,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 706 [2022-07-22 12:34:01,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 706 [2022-07-22 12:34:01,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 706 states and 1689 transitions. [2022-07-22 12:34:01,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:01,632 INFO L220 hiAutomatonCegarLoop]: Abstraction has 706 states and 1689 transitions. [2022-07-22 12:34:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states and 1689 transitions. [2022-07-22 12:34:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 638. [2022-07-22 12:34:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 638 states have (on average 2.415360501567398) internal successors, (1541), 637 states have internal predecessors, (1541), 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:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1541 transitions. [2022-07-22 12:34:01,658 INFO L242 hiAutomatonCegarLoop]: Abstraction has 638 states and 1541 transitions. [2022-07-22 12:34:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:01,660 INFO L425 stractBuchiCegarLoop]: Abstraction has 638 states and 1541 transitions. [2022-07-22 12:34:01,660 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:34:01,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 638 states and 1541 transitions. [2022-07-22 12:34:01,665 INFO L131 ngComponentsAnalysis]: Automaton has 154 accepting balls. 154 [2022-07-22 12:34:01,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:01,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:01,667 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:01,667 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:01,668 INFO L748 eck$LassoCheckResult]: Stem: 18823#[ULTIMATE.startENTRY]don't care [531] ULTIMATE.startENTRY-->L845-2: Formula: (let ((.cse0 (store |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 1)) (.cse1 (select |v_#memory_int_46| 1))) (and (= (select |v_#valid_81| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 0) (= |v_#memory_int_45| (store |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37| (store (select |v_#memory_int_46| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_27|))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37| 1) |v_#valid_80|) (= 48 (select .cse1 0)) (= v_~y~0_50 0) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre4#1_27|) (= v_~b1~0_22 0) (= 2 (select |v_#length_56| 1)) (= (select |v_#valid_81| 1) 1) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= v_~b2~0_22 0) (= v_~x~0_14 0) (= |v_#length_55| (store (store |v_#length_56| |v_ULTIMATE.start_main_~#t1~0#1.base_37| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_37| 4)) (< 0 |v_#StackHeapBarrier_24|) (= v_~X~0_32 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2~0#1.base_37|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_37|) 0) (= |v_#NULL.offset_8| 0) (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t1~0#1.base_37|) (= (select |v_#length_56| 2) 10) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.base_8| 0) (= (select |v_#valid_81| 0) 0) (= (select |v_#valid_81| 2) 1) (= (select .cse1 1) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_34|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_46|, #length=|v_#length_56|} OutVars{~b2~0=v_~b2~0_22, 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_20|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_37|, ~X~0=v_~X~0_32, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_8|, #StackHeapBarrier=|v_#StackHeapBarrier_24|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_17|, #valid=|v_#valid_80|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_45|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_22|, #length=|v_#length_55|, ~y~0=v_~y~0_50, ~b1~0=v_~b1~0_22, ~x~0=v_~x~0_14, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_37|} AuxVars[] AssignedVars[~b2~0, 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, ~X~0, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, #length, ~y~0, ~b1~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 18825#[L845-2]don't care [449] L845-2-->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_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, thr1Thread1of1ForFork1_~b21~0=v_thr1Thread1of1ForFork1_~b21~0_10, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_30, 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, thr1Thread1of1ForFork1_~x1~0=v_thr1Thread1of1ForFork1_~x1~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~b21~0, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_~y1~0, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_~x1~0] 18307#[thr1ENTRY, L845-3]don't care [481] thr1ENTRY-->L753-1: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_.offset_7| v_thr1Thread1of1ForFork1_~_.offset_7) (= v_thr1Thread1of1ForFork1_~_.base_7 |v_thr1Thread1of1ForFork1_#in~_.base_7|)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_7|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_7, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_7|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset] 18309#[L753-1, L845-3]don't care [458] L753-1-->L707: Formula: (= v_~b1~0_10 1) InVars {} OutVars{~b1~0=v_~b1~0_10} AuxVars[] AssignedVars[~b1~0] 18523#[L845-3, L707]don't care [411] L707-->L710: Formula: (= v_~x~0_3 1) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] 18319#[L710, L845-3]don't care [466] L710-->L728: Formula: (and (= v_thr1Thread1of1ForFork1_~y1~0_41 0) (= v_thr1Thread1of1ForFork1_~y1~0_41 v_~y~0_26)) InVars {~y~0=v_~y~0_26} OutVars{thr1Thread1of1ForFork1_~y1~0=v_thr1Thread1of1ForFork1_~y1~0_41, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~y1~0] 18321#[L845-3, L728]don't care [420] L728-->L730: Formula: (= v_~y~0_16 1) InVars {} OutVars{~y~0=v_~y~0_16} AuxVars[] AssignedVars[~y~0] 18517#[L730, L845-3]don't care [524] L845-3-->L846-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_19| |v_#pthreadsForks_22|) (= (select |v_#valid_58| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_41| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre6#1_19|))) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_30|, #length=|v_#length_41|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_19|, #pthreadsForks=|v_#pthreadsForks_21|, 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_58|, #memory_int=|v_#memory_int_29|, #length=|v_#length_41|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_21|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 18667#[L730, L846-3]don't care [446] L846-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_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_30, 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_~x2~0=v_thr2Thread1of1ForFork0_~x2~0_8, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_~b12~0=v_thr2Thread1of1ForFork0_~b12~0_10, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4, thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0, thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~x2~0, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_~b12~0, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base] 18769#[L846-4, L730, thr2ENTRY]don't care [468] thr2ENTRY-->L823-1: Formula: (and (= v_thr2Thread1of1ForFork0_~_.offset_5 |v_thr2Thread1of1ForFork0_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork0_#in~_.base_5| v_thr2Thread1of1ForFork0_~_.base_5)) 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|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_5|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base] 18817#[L846-4, L730, L823-1]don't care [502] L823-1-->L777: Formula: (= v_~b2~0_14 1) InVars {} OutVars{~b2~0=v_~b2~0_14} AuxVars[] AssignedVars[~b2~0] 18437#[L846-4, L730, L777]don't care [369] L777-->L780: Formula: (= 2 v_~x~0_1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] 18733#[L846-4, L730, L780]don't care [372] L780-->L783: Formula: (= v_~y~0_2 v_thr2Thread1of1ForFork0_~y2~0_1) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 18789#[L846-4, L783, L730]don't care [483] L783-->L787: Formula: (and (= v_~b2~0_10 0) (not (= v_thr2Thread1of1ForFork0_~y2~0_43 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_43} OutVars{~b2~0=v_~b2~0_10, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_43} AuxVars[] AssignedVars[~b2~0] 18907#[L846-4, L730, L787]don't care [380] L787-->L794: Formula: (= v_~y~0_3 v_thr2Thread1of1ForFork0_~y2~0_7) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 18941#[L846-4, L730, L794]don't care [2022-07-22 12:34:01,668 INFO L750 eck$LassoCheckResult]: Loop: 18941#[L846-4, L730, L794]don't care [476] L794-->L794: Formula: (and (= v_thr2Thread1of1ForFork0_~y2~0_31 v_~y~0_32) (not (= v_thr2Thread1of1ForFork0_~y2~0_32 0))) InVars {thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_32, ~y~0=v_~y~0_32} OutVars{thr2Thread1of1ForFork0_~y2~0=v_thr2Thread1of1ForFork0_~y2~0_31, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~y2~0] 18941#[L846-4, L730, L794]don't care [2022-07-22 12:34:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1337890181, now seen corresponding path program 1 times [2022-07-22 12:34:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674740654] [2022-07-22 12:34:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:01,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 507, now seen corresponding path program 2 times [2022-07-22 12:34:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:01,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616077977] [2022-07-22 12:34:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1475076873, now seen corresponding path program 1 times [2022-07-22 12:34:01,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:01,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574118638] [2022-07-22 12:34:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:01,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:01,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:03,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:34:03 BoogieIcfgContainer [2022-07-22 12:34:03,085 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:34:03,090 INFO L158 Benchmark]: Toolchain (without parser) took 8941.34ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 131.9MB in the beginning and 96.2MB in the end (delta: 35.7MB). Peak memory consumption was 69.1MB. Max. memory is 8.0GB. [2022-07-22 12:34:03,090 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 160.4MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:34:03,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.21ms. Allocated memory is still 160.4MB. Free memory was 131.7MB in the beginning and 111.7MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-07-22 12:34:03,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.68ms. Allocated memory is still 160.4MB. Free memory was 111.7MB in the beginning and 109.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:34:03,096 INFO L158 Benchmark]: Boogie Preprocessor took 80.66ms. Allocated memory is still 160.4MB. Free memory was 109.8MB in the beginning and 108.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:03,101 INFO L158 Benchmark]: RCFGBuilder took 553.00ms. Allocated memory is still 160.4MB. Free memory was 108.1MB in the beginning and 129.3MB in the end (delta: -21.2MB). Peak memory consumption was 4.1MB. Max. memory is 8.0GB. [2022-07-22 12:34:03,102 INFO L158 Benchmark]: BuchiAutomizer took 7394.95ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 129.3MB in the beginning and 96.2MB in the end (delta: 33.0MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2022-07-22 12:34:03,109 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.24ms. Allocated memory is still 160.4MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 810.21ms. Allocated memory is still 160.4MB. Free memory was 131.7MB in the beginning and 111.7MB in the end (delta: 20.0MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 90.68ms. Allocated memory is still 160.4MB. Free memory was 111.7MB in the beginning and 109.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.66ms. Allocated memory is still 160.4MB. Free memory was 109.8MB in the beginning and 108.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 553.00ms. Allocated memory is still 160.4MB. Free memory was 108.1MB in the beginning and 129.3MB in the end (delta: -21.2MB). Peak memory consumption was 4.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 7394.95ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 129.3MB in the beginning and 96.2MB in the end (delta: 33.0MB). Peak memory consumption was 66.1MB. 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 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 638 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.7s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1650 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.2s 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, 616 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 408 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 729 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1230 IncrementalHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 184 mSDtfsCounter, 1230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN4 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 791]: 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, \result={0:0}, _={0:0}, _={0:0}, _={0:0}, _={0:0}, b1=1, b12=0, b2=0, b21=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2890519d in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b7e7a3b in10890,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@46d25f1f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@a72e931=0, t1={32763:0}, t2={3:0}, X=0, x=2, x1=0, x2=0, y=1, y1=0, y2=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 791]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int x, y; [L701] 0 int b1, b2; [L702] 0 int X; [L844] 0 pthread_t t1, t2; [L845] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L704] COND TRUE 1 1 [L706] 1 b1 = 1 [L709] 1 x = 1 [L712] 1 int y1 = y; [L714] COND FALSE 1 !(y1 != 0) [L729] 1 y = 1 [L846] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L774] COND TRUE 2 1 [L776] 2 b2 = 1 [L779] 2 x = 2 [L782] 2 int y2 = y; [L784] COND TRUE 2 y2 != 0 [L786] 2 b2 = 0 [L789] 2 y2 = y Loop: [L791] COND TRUE y2 != 0 [L793] y2 = y End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 112 PlacesBefore, 53 PlacesAfterwards, 129 TransitionsBefore, 63 TransitionsAfterwards, 4788 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 80 TotalNumberOfCompositions, 16596 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6382, positive: 5955, positive conditional: 0, positive unconditional: 5955, negative: 427, negative conditional: 0, negative unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2194, positive: 2143, positive conditional: 0, positive unconditional: 2143, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6382, positive: 3812, positive conditional: 0, positive unconditional: 3812, negative: 376, negative conditional: 0, negative unconditional: 376, unknown: 2194, unknown conditional: 0, unknown unconditional: 2194] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 381, Positive conditional cache size: 0, Positive unconditional cache size: 381, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:34:03,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...