/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/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:34:02,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:34:02,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:34:02,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:34:02,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:34:02,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:34:02,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:34:02,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:34:02,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:34:02,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:34:02,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:34:02,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:34:02,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:34:02,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:34:02,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:34:02,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:34:02,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:34:02,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:34:02,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:34:02,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:34:02,631 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:34:02,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:34:02,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:34:02,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:34:02,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:34:02,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:34:02,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:34:02,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:34:02,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:34:02,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:34:02,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:34:02,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:34:02,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:34:02,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:34:02,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:34:02,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:34:02,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:34:02,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:34:02,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:34:02,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:34:02,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:34:02,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:34:02,653 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:34:02,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:34:02,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:34:02,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:34:02,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:34:02,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:34:02,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:34:02,686 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:34:02,686 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:34:02,686 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:34:02,686 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:34:02,687 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:34:02,687 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:34:02,687 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:34:02,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:34:02,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:34:02,688 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:34:02,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:34:02,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:34:02,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:34:02,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:34:02,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:34:02,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:34:02,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:34:02,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:34:02,690 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:34:02,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:34:02,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:34:02,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:34:02,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:34:02,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:34:02,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:34:02,692 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:34:02,693 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:34:02,693 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:34:03,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:34:03,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:34:03,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:34:03,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:34:03,074 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:34:03,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2022-07-22 12:34:03,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1d58b61/99802f1c75d4449c8374f2d8db155945/FLAG942920dbc [2022-07-22 12:34:03,799 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:34:03,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2022-07-22 12:34:03,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1d58b61/99802f1c75d4449c8374f2d8db155945/FLAG942920dbc [2022-07-22 12:34:04,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1d58b61/99802f1c75d4449c8374f2d8db155945 [2022-07-22 12:34:04,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:34:04,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:34:04,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:34:04,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:34:04,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:34:04,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764108e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04, skipping insertion in model container [2022-07-22 12:34:04,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:34:04,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:34:04,304 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:34:04,436 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/szymanski.i[31505,31518] [2022-07-22 12:34:04,442 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/szymanski.i[32915,32928] [2022-07-22 12:34:04,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:34:04,458 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:34:04,476 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:34:04,503 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/szymanski.i[31505,31518] [2022-07-22 12:34:04,508 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/szymanski.i[32915,32928] [2022-07-22 12:34:04,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:34:04,576 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:34:04,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04 WrapperNode [2022-07-22 12:34:04,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:34:04,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:34:04,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:34:04,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:34:04,589 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:34:04" (1/1) ... [2022-07-22 12:34:04,634 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:34:04" (1/1) ... [2022-07-22 12:34:04,665 INFO L137 Inliner]: procedures = 171, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-07-22 12:34:04,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:34:04,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:34:04,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:34:04,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:34:04,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:34:04,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:34:04,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:34:04,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:34:04,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (1/1) ... [2022-07-22 12:34:04,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:34:04,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:34:04,790 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:34:04,795 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:34:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:34:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-22 12:34:04,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-22 12:34:04,853 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-22 12:34:04,853 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-22 12:34:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:34:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:34:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:34:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:34:04,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:34:04,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:34:04,855 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:34:04,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:34:04,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:34:04,857 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:34:05,039 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:34:05,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:34:05,283 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:34:05,292 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:34:05,293 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 12:34:05,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:34:05 BoogieIcfgContainer [2022-07-22 12:34:05,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:34:05,297 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:34:05,298 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:34:05,302 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:34:05,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:34:05,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:34:04" (1/3) ... [2022-07-22 12:34:05,304 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3da6e88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:34:05, skipping insertion in model container [2022-07-22 12:34:05,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:34:05,304 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:34:04" (2/3) ... [2022-07-22 12:34:05,304 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3da6e88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:34:05, skipping insertion in model container [2022-07-22 12:34:05,304 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:34:05,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:34:05" (3/3) ... [2022-07-22 12:34:05,306 INFO L322 chiAutomizerObserver]: Analyzing ICFG szymanski.i [2022-07-22 12:34:05,417 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:34:05,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 117 transitions, 250 flow [2022-07-22 12:34:05,517 INFO L129 PetriNetUnfolder]: 20/113 cut-off events. [2022-07-22 12:34:05,521 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:34:05,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 20/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 148 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 81. Up to 3 conditions per place. [2022-07-22 12:34:05,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 117 transitions, 250 flow [2022-07-22 12:34:05,548 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 113 transitions, 238 flow [2022-07-22 12:34:05,552 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:34:05,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 113 transitions, 238 flow [2022-07-22 12:34:05,575 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 113 transitions, 238 flow [2022-07-22 12:34:05,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 113 transitions, 238 flow [2022-07-22 12:34:05,615 INFO L129 PetriNetUnfolder]: 20/113 cut-off events. [2022-07-22 12:34:05,615 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:34:05,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 113 events. 20/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 81. Up to 3 conditions per place. [2022-07-22 12:34:05,621 INFO L116 LiptonReduction]: Number of co-enabled transitions 3500 [2022-07-22 12:34:07,848 INFO L131 LiptonReduction]: Checked pairs total: 7550 [2022-07-22 12:34:07,848 INFO L133 LiptonReduction]: Total number of compositions: 82 [2022-07-22 12:34:07,870 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:34:07,870 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:34:07,870 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:34:07,871 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:34:07,871 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:34:07,871 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:34:07,871 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:34:07,871 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:34:07,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:34:08,060 INFO L131 ngComponentsAnalysis]: Automaton has 200 accepting balls. 200 [2022-07-22 12:34:08,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:08,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:08,067 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:34:08,067 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:08,067 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:34:08,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 421 states, but on-demand construction may add more states [2022-07-22 12:34:08,090 INFO L131 ngComponentsAnalysis]: Automaton has 200 accepting balls. 200 [2022-07-22 12:34:08,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:08,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:08,096 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:34:08,096 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:08,101 INFO L748 eck$LassoCheckResult]: Stem: 105#[ULTIMATE.startENTRY]don't care [477] ULTIMATE.startENTRY-->L818-2: Formula: (let ((.cse0 (select |v_#memory_int_50| 1)) (.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_#NULL.base_10| 0) (= (select |v_#length_58| 2) 12) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#length_57| (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (store |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_25|)) |v_#memory_int_49|) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre4#1_25|) (= (select |v_#valid_89| 0) 0) (= v_~x~0_32 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= v_~flag1~0_52 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (= v_~flag2~0_56 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select .cse0 0) 48) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_50|, #length=|v_#length_58|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_15|, ~flag2~0=v_~flag2~0_56, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_24|, ~flag1~0=v_~flag1~0_52, #length=|v_#length_57|, ~x~0=v_~x~0_32, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 108#[L818-2]don't care [390] L818-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 110#[L818-3, thr1ENTRY]don't care [414] thr1ENTRY-->L705: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_28 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_28, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 114#[L705, L818-3]don't care [355] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 120#[L712, L818-3]don't care [2022-07-22 12:34:08,101 INFO L750 eck$LassoCheckResult]: Loop: 120#[L712, L818-3]don't care [445] L712-->L712: Formula: (and (<= 3 v_thr1Thread1of1ForFork0_~f21~0_64) (= v_thr1Thread1of1ForFork0_~f21~0_63 v_~flag2~0_44)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_64, ~flag2~0=v_~flag2~0_44} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_63, ~flag2~0=v_~flag2~0_44} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 120#[L712, L818-3]don't care [2022-07-22 12:34:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 15521807, now seen corresponding path program 1 times [2022-07-22 12:34:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540538417] [2022-07-22 12:34:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash 476, now seen corresponding path program 1 times [2022-07-22 12:34:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105715466] [2022-07-22 12:34:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,359 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:08,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:08,378 INFO L85 PathProgramCache]: Analyzing trace with hash 481176462, now seen corresponding path program 1 times [2022-07-22 12:34:08,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:08,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785548028] [2022-07-22 12:34:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:08,548 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:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:08,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785548028] [2022-07-22 12:34:08,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785548028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:08,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:08,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:34:08,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401320074] [2022-07-22 12:34:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:08,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:08,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:08,611 INFO L87 Difference]: Start difference. First operand currently 421 states, but on-demand construction may add more states Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:08,860 INFO L93 Difference]: Finished difference Result 654 states and 1876 transitions. [2022-07-22 12:34:08,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 654 states and 1876 transitions. [2022-07-22 12:34:08,889 INFO L131 ngComponentsAnalysis]: Automaton has 258 accepting balls. 258 [2022-07-22 12:34:08,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 654 states to 606 states and 1760 transitions. [2022-07-22 12:34:08,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 606 [2022-07-22 12:34:08,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 606 [2022-07-22 12:34:08,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 606 states and 1760 transitions. [2022-07-22 12:34:08,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:08,952 INFO L220 hiAutomatonCegarLoop]: Abstraction has 606 states and 1760 transitions. [2022-07-22 12:34:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states and 1760 transitions. [2022-07-22 12:34:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 450. [2022-07-22 12:34:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 450 states have (on average 2.948888888888889) internal successors, (1327), 449 states have internal predecessors, (1327), 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:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1327 transitions. [2022-07-22 12:34:09,033 INFO L242 hiAutomatonCegarLoop]: Abstraction has 450 states and 1327 transitions. [2022-07-22 12:34:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:09,041 INFO L425 stractBuchiCegarLoop]: Abstraction has 450 states and 1327 transitions. [2022-07-22 12:34:09,041 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:34:09,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 1327 transitions. [2022-07-22 12:34:09,047 INFO L131 ngComponentsAnalysis]: Automaton has 202 accepting balls. 202 [2022-07-22 12:34:09,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:09,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:09,048 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:34:09,048 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:09,049 INFO L748 eck$LassoCheckResult]: Stem: 2447#[ULTIMATE.startENTRY]don't care [477] ULTIMATE.startENTRY-->L818-2: Formula: (let ((.cse0 (select |v_#memory_int_50| 1)) (.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_#NULL.base_10| 0) (= (select |v_#length_58| 2) 12) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#length_57| (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (store |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_25|)) |v_#memory_int_49|) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre4#1_25|) (= (select |v_#valid_89| 0) 0) (= v_~x~0_32 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= v_~flag1~0_52 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (= v_~flag2~0_56 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select .cse0 0) 48) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_50|, #length=|v_#length_58|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_15|, ~flag2~0=v_~flag2~0_56, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_24|, ~flag1~0=v_~flag1~0_52, #length=|v_#length_57|, ~x~0=v_~x~0_32, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 1837#[L818-2]don't care [390] L818-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 1839#[L818-3, thr1ENTRY]don't care [470] L818-3-->L819-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_28|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, 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_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 2393#[L819-3, thr1ENTRY]don't care [393] L819-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 2237#[thr1ENTRY, L819-4, thr2ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_30 1) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_30, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 2039#[L762, thr1ENTRY, L819-4]don't care [320] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 2041#[thr1ENTRY, L819-4, L769]don't care [2022-07-22 12:34:09,049 INFO L750 eck$LassoCheckResult]: Loop: 2041#[thr1ENTRY, L819-4, L769]don't care [431] L769-->L769: Formula: (and (= v_~flag1~0_30 v_thr2Thread1of1ForFork1_~f12~0_51) (<= 3 v_thr2Thread1of1ForFork1_~f12~0_52)) InVars {~flag1~0=v_~flag1~0_30, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_52} OutVars{~flag1~0=v_~flag1~0_30, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_51} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 2041#[thr1ENTRY, L819-4, L769]don't care [2022-07-22 12:34:09,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2033272917, now seen corresponding path program 1 times [2022-07-22 12:34:09,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492125040] [2022-07-22 12:34:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,116 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash 462, now seen corresponding path program 1 times [2022-07-22 12:34:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843176500] [2022-07-22 12:34:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,174 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1393048582, now seen corresponding path program 1 times [2022-07-22 12:34:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133788701] [2022-07-22 12:34:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:09,254 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:09,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:09,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133788701] [2022-07-22 12:34:09,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133788701] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:09,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:09,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:34:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873819096] [2022-07-22 12:34:09,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:09,267 INFO L87 Difference]: Start difference. First operand 450 states and 1327 transitions. cyclomatic complexity: 1079 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:09,414 INFO L93 Difference]: Finished difference Result 680 states and 1917 transitions. [2022-07-22 12:34:09,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 680 states and 1917 transitions. [2022-07-22 12:34:09,426 INFO L131 ngComponentsAnalysis]: Automaton has 248 accepting balls. 248 [2022-07-22 12:34:09,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 680 states to 610 states and 1732 transitions. [2022-07-22 12:34:09,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2022-07-22 12:34:09,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 610 [2022-07-22 12:34:09,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 610 states and 1732 transitions. [2022-07-22 12:34:09,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:09,440 INFO L220 hiAutomatonCegarLoop]: Abstraction has 610 states and 1732 transitions. [2022-07-22 12:34:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states and 1732 transitions. [2022-07-22 12:34:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 504. [2022-07-22 12:34:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 504 states have (on average 2.865079365079365) internal successors, (1444), 503 states have internal predecessors, (1444), 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:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1444 transitions. [2022-07-22 12:34:09,473 INFO L242 hiAutomatonCegarLoop]: Abstraction has 504 states and 1444 transitions. [2022-07-22 12:34:09,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:09,475 INFO L425 stractBuchiCegarLoop]: Abstraction has 504 states and 1444 transitions. [2022-07-22 12:34:09,475 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:34:09,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 1444 transitions. [2022-07-22 12:34:09,480 INFO L131 ngComponentsAnalysis]: Automaton has 214 accepting balls. 214 [2022-07-22 12:34:09,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:09,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:09,481 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:09,481 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:09,482 INFO L748 eck$LassoCheckResult]: Stem: 4080#[ULTIMATE.startENTRY]don't care [477] ULTIMATE.startENTRY-->L818-2: Formula: (let ((.cse0 (select |v_#memory_int_50| 1)) (.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_#NULL.base_10| 0) (= (select |v_#length_58| 2) 12) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#length_57| (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (store |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_25|)) |v_#memory_int_49|) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre4#1_25|) (= (select |v_#valid_89| 0) 0) (= v_~x~0_32 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= v_~flag1~0_52 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (= v_~flag2~0_56 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select .cse0 0) 48) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_50|, #length=|v_#length_58|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_15|, ~flag2~0=v_~flag2~0_56, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_24|, ~flag1~0=v_~flag1~0_52, #length=|v_#length_57|, ~x~0=v_~x~0_32, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 3412#[L818-2]don't care [390] L818-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 3414#[L818-3, thr1ENTRY]don't care [470] L818-3-->L819-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_28|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, 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_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 3958#[L819-3, thr1ENTRY]don't care [393] L819-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 3782#[thr1ENTRY, L819-4, thr2ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_30 1) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_30, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 3592#[L762, thr1ENTRY, L819-4]don't care [414] thr1ENTRY-->L705: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_28 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_28, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 3476#[L762, L819-4, L705]don't care [320] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 3478#[L769, L819-4, L705]don't care [2022-07-22 12:34:09,482 INFO L750 eck$LassoCheckResult]: Loop: 3478#[L769, L819-4, L705]don't care [431] L769-->L769: Formula: (and (= v_~flag1~0_30 v_thr2Thread1of1ForFork1_~f12~0_51) (<= 3 v_thr2Thread1of1ForFork1_~f12~0_52)) InVars {~flag1~0=v_~flag1~0_30, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_52} OutVars{~flag1~0=v_~flag1~0_30, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_51} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 3478#[L769, L819-4, L705]don't care [2022-07-22 12:34:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1393045779, now seen corresponding path program 1 times [2022-07-22 12:34:09,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856697310] [2022-07-22 12:34:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash 462, now seen corresponding path program 2 times [2022-07-22 12:34:09,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060302387] [2022-07-22 12:34:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,551 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash -234745758, now seen corresponding path program 1 times [2022-07-22 12:34:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934817736] [2022-07-22 12:34:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:09,610 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:09,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:09,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934817736] [2022-07-22 12:34:09,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934817736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:09,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:09,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:34:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590108425] [2022-07-22 12:34:09,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:09,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:09,624 INFO L87 Difference]: Start difference. First operand 504 states and 1444 transitions. cyclomatic complexity: 1154 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:09,766 INFO L93 Difference]: Finished difference Result 680 states and 1888 transitions. [2022-07-22 12:34:09,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 680 states and 1888 transitions. [2022-07-22 12:34:09,779 INFO L131 ngComponentsAnalysis]: Automaton has 258 accepting balls. 258 [2022-07-22 12:34:09,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 680 states to 680 states and 1888 transitions. [2022-07-22 12:34:09,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 680 [2022-07-22 12:34:09,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 680 [2022-07-22 12:34:09,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 680 states and 1888 transitions. [2022-07-22 12:34:09,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:09,807 INFO L220 hiAutomatonCegarLoop]: Abstraction has 680 states and 1888 transitions. [2022-07-22 12:34:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states and 1888 transitions. [2022-07-22 12:34:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 522. [2022-07-22 12:34:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 522 states have (on average 2.8256704980842913) internal successors, (1475), 521 states have internal predecessors, (1475), 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:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1475 transitions. [2022-07-22 12:34:09,852 INFO L242 hiAutomatonCegarLoop]: Abstraction has 522 states and 1475 transitions. [2022-07-22 12:34:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:09,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 522 states and 1475 transitions. [2022-07-22 12:34:09,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:34:09,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 1475 transitions. [2022-07-22 12:34:09,868 INFO L131 ngComponentsAnalysis]: Automaton has 208 accepting balls. 208 [2022-07-22 12:34:09,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:09,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:09,869 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:09,869 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:09,869 INFO L748 eck$LassoCheckResult]: Stem: 5837#[ULTIMATE.startENTRY]don't care [477] ULTIMATE.startENTRY-->L818-2: Formula: (let ((.cse0 (select |v_#memory_int_50| 1)) (.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_#NULL.base_10| 0) (= (select |v_#length_58| 2) 12) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#length_57| (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (store |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_25|)) |v_#memory_int_49|) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre4#1_25|) (= (select |v_#valid_89| 0) 0) (= v_~x~0_32 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= v_~flag1~0_52 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (= v_~flag2~0_56 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select .cse0 0) 48) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_50|, #length=|v_#length_58|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_15|, ~flag2~0=v_~flag2~0_56, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_24|, ~flag1~0=v_~flag1~0_52, #length=|v_#length_57|, ~x~0=v_~x~0_32, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 5119#[L818-2]don't care [390] L818-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 5121#[L818-3, thr1ENTRY]don't care [470] L818-3-->L819-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_28|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, 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_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 5703#[L819-3, thr1ENTRY]don't care [393] L819-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 5507#[thr1ENTRY, L819-4, thr2ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_30 1) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_30, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 5297#[L762, thr1ENTRY, L819-4]don't care [414] thr1ENTRY-->L705: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_28 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_28, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 5183#[L762, L819-4, L705]don't care [355] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 5189#[L762, L712, L819-4]don't care [2022-07-22 12:34:09,870 INFO L750 eck$LassoCheckResult]: Loop: 5189#[L762, L712, L819-4]don't care [445] L712-->L712: Formula: (and (<= 3 v_thr1Thread1of1ForFork0_~f21~0_64) (= v_thr1Thread1of1ForFork0_~f21~0_63 v_~flag2~0_44)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_64, ~flag2~0=v_~flag2~0_44} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_63, ~flag2~0=v_~flag2~0_44} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 5189#[L762, L712, L819-4]don't care [2022-07-22 12:34:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1393045744, now seen corresponding path program 1 times [2022-07-22 12:34:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895059787] [2022-07-22 12:34:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash 476, now seen corresponding path program 2 times [2022-07-22 12:34:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381658584] [2022-07-22 12:34:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:09,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -234744659, now seen corresponding path program 1 times [2022-07-22 12:34:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:09,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45662518] [2022-07-22 12:34:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:34:09,947 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:09,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:34:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45662518] [2022-07-22 12:34:09,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45662518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:34:09,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:34:09,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:34:09,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58911089] [2022-07-22 12:34:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:34:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:34:09,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:34:09,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:34:09,961 INFO L87 Difference]: Start difference. First operand 522 states and 1475 transitions. cyclomatic complexity: 1161 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:34:10,100 INFO L93 Difference]: Finished difference Result 736 states and 2037 transitions. [2022-07-22 12:34:10,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 736 states and 2037 transitions. [2022-07-22 12:34:10,109 INFO L131 ngComponentsAnalysis]: Automaton has 282 accepting balls. 282 [2022-07-22 12:34:10,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 736 states to 736 states and 2037 transitions. [2022-07-22 12:34:10,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 736 [2022-07-22 12:34:10,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 736 [2022-07-22 12:34:10,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 736 states and 2037 transitions. [2022-07-22 12:34:10,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:34:10,123 INFO L220 hiAutomatonCegarLoop]: Abstraction has 736 states and 2037 transitions. [2022-07-22 12:34:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states and 2037 transitions. [2022-07-22 12:34:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 594. [2022-07-22 12:34:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 594 states have (on average 2.7626262626262625) internal successors, (1641), 593 states have internal predecessors, (1641), 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:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1641 transitions. [2022-07-22 12:34:10,146 INFO L242 hiAutomatonCegarLoop]: Abstraction has 594 states and 1641 transitions. [2022-07-22 12:34:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:34:10,147 INFO L425 stractBuchiCegarLoop]: Abstraction has 594 states and 1641 transitions. [2022-07-22 12:34:10,147 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:34:10,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 594 states and 1641 transitions. [2022-07-22 12:34:10,152 INFO L131 ngComponentsAnalysis]: Automaton has 236 accepting balls. 236 [2022-07-22 12:34:10,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:34:10,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:34:10,153 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:34:10,153 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:34:10,154 INFO L748 eck$LassoCheckResult]: Stem: 7636#[ULTIMATE.startENTRY]don't care [477] ULTIMATE.startENTRY-->L818-2: Formula: (let ((.cse0 (select |v_#memory_int_50| 1)) (.cse1 (store |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 1))) (and (= (select |v_#valid_89| 2) 1) (= (select |v_#valid_89| 1) 1) (= |v_#NULL.base_10| 0) (= (select |v_#length_58| 2) 12) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (select |v_#length_58| 1) 2) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_#length_57| (store (store |v_#length_58| |v_ULTIMATE.start_main_~#t1~0#1.base_35| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (store |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_50| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre4#1_25|)) |v_#memory_int_49|) (= (select |v_#valid_89| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 0) (= |v_#pthreadsForks_36| |v_ULTIMATE.start_main_#t~pre4#1_25|) (= (select |v_#valid_89| 0) 0) (= v_~x~0_32 0) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= v_~flag1~0_52 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (= v_~flag2~0_56 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= (select .cse0 0) 48) (= |v_#valid_88| (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1~0#1.base_35|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_50|, #length=|v_#length_58|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_25|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_18|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_24|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_25|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, #NULL.base=|v_#NULL.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_20|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_15|, ~flag2~0=v_~flag2~0_56, #valid=|v_#valid_88|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_15|, #memory_int=|v_#memory_int_49|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_24|, ~flag1~0=v_~flag1~0_52, #length=|v_#length_57|, ~x~0=v_~x~0_32, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#res#1, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, #NULL.base, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, ~flag2~0, #valid, ULTIMATE.start_main_#t~nondet7#1, #memory_int, ULTIMATE.start_main_#t~mem9#1, ~flag1~0, #length, ~x~0, ULTIMATE.start_main_~#t2~0#1.base] 6894#[L818-2]don't care [390] L818-2-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_40, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset] 6896#[L818-3, thr1ENTRY]don't care [470] L818-3-->L819-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_21| |v_#pthreadsForks_28|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_#memory_int_37| (store |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_38| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre6#1_21|))) (= (select |v_#valid_74| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_29| 4) (select |v_#length_47| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_29|)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_38|, #length=|v_#length_47|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_21|, #pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_29|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_11|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_37|, #length=|v_#length_47|, 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_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet5#1, #memory_int, ULTIMATE.start_main_#t~pre4#1] 7496#[L819-3, thr1ENTRY]don't care [393] L819-3-->thr2ENTRY: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_40, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 7270#[thr1ENTRY, L819-4, thr2ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= v_~flag2~0_30 1) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_30, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 7070#[L762, thr1ENTRY, L819-4]don't care [320] L762-->L769: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 7072#[thr1ENTRY, L819-4, L769]don't care [451] L769-->L773: Formula: (and (= v_~flag2~0_Out_10 3) (not (<= 3 v_thr2Thread1of1ForFork1_~f12~0_In_7))) InVars {thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_In_7} OutVars{thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_In_7, ~flag2~0=v_~flag2~0_Out_10} AuxVars[] AssignedVars[~flag2~0] 7404#[L773, thr1ENTRY, L819-4]don't care [414] thr1ENTRY-->L705: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_5 |v_thr1Thread1of1ForFork0_#in~_.base_5|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_5| v_thr1Thread1of1ForFork0_~_.offset_5) (= v_~flag1~0_28 1)) InVars {thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_5, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_5|, ~flag1~0=v_~flag1~0_28, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 7434#[L773, L819-4, L705]don't care [355] L705-->L712: Formula: (= v_~flag2~0_8 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_8} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_8} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 7436#[L773, L712, L819-4]don't care [2022-07-22 12:34:10,154 INFO L750 eck$LassoCheckResult]: Loop: 7436#[L773, L712, L819-4]don't care [445] L712-->L712: Formula: (and (<= 3 v_thr1Thread1of1ForFork0_~f21~0_64) (= v_thr1Thread1of1ForFork0_~f21~0_63 v_~flag2~0_44)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_64, ~flag2~0=v_~flag2~0_44} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_63, ~flag2~0=v_~flag2~0_44} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 7436#[L773, L712, L819-4]don't care [2022-07-22 12:34:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:10,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1310141459, now seen corresponding path program 1 times [2022-07-22 12:34:10,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:10,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676258946] [2022-07-22 12:34:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:10,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:10,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 476, now seen corresponding path program 3 times [2022-07-22 12:34:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:10,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680436712] [2022-07-22 12:34:10,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:10,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:10,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:34:10,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1959680010, now seen corresponding path program 1 times [2022-07-22 12:34:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:34:10,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906645686] [2022-07-22 12:34:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:34:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:34:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:10,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:34:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:34:10,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:34:11,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:34:11 BoogieIcfgContainer [2022-07-22 12:34:11,226 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:34:11,227 INFO L158 Benchmark]: Toolchain (without parser) took 7173.70ms. Allocated memory was 152.0MB in the beginning and 187.7MB in the end (delta: 35.7MB). Free memory was 124.2MB in the beginning and 106.1MB in the end (delta: 18.2MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2022-07-22 12:34:11,229 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 152.0MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:34:11,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.48ms. Allocated memory is still 152.0MB. Free memory was 124.0MB in the beginning and 104.3MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-07-22 12:34:11,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.97ms. Allocated memory is still 152.0MB. Free memory was 104.3MB in the beginning and 102.4MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:11,234 INFO L158 Benchmark]: Boogie Preprocessor took 73.86ms. Allocated memory is still 152.0MB. Free memory was 102.2MB in the beginning and 100.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:34:11,235 INFO L158 Benchmark]: RCFGBuilder took 551.34ms. Allocated memory is still 152.0MB. Free memory was 100.8MB in the beginning and 125.3MB in the end (delta: -24.6MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-07-22 12:34:11,239 INFO L158 Benchmark]: BuchiAutomizer took 5928.85ms. Allocated memory was 152.0MB in the beginning and 187.7MB in the end (delta: 35.7MB). Free memory was 125.3MB in the beginning and 106.1MB in the end (delta: 19.3MB). Peak memory consumption was 56.5MB. Max. memory is 8.0GB. [2022-07-22 12:34:11,245 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.20ms. Allocated memory is still 152.0MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 517.48ms. Allocated memory is still 152.0MB. Free memory was 124.0MB in the beginning and 104.3MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.97ms. Allocated memory is still 152.0MB. Free memory was 104.3MB in the beginning and 102.4MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.86ms. Allocated memory is still 152.0MB. Free memory was 102.2MB in the beginning and 100.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 551.34ms. Allocated memory is still 152.0MB. Free memory was 100.8MB in the beginning and 125.3MB in the end (delta: -24.6MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 5928.85ms. Allocated memory was 152.0MB in the beginning and 187.7MB in the end (delta: 35.7MB). Free memory was 125.3MB in the beginning and 106.1MB in the end (delta: 19.3MB). Peak memory consumption was 56.5MB. 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 594 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 562 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s 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, 222 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 222 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 594 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 77 mSDtfsCounter, 594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 2.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 709]: 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}, f12=0, f21=3, flag1=1, flag2=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73c79124 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76e70e06 in0,34385, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@254c860a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@63f030b7=0, t1={26289:0}, t2={26290:0}, x=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 709]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int flag1 = 0, flag2 = 0; [L701] 0 int x; [L817] 0 pthread_t t1, t2; [L818] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) [L819] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) [L761] 2 flag2 = 1 [L764] 2 int f12 = flag1; [L766] COND FALSE 2 !(f12 >= 3) [L772] 2 flag2 = 3 [L704] 1 flag1 = 1 [L707] 1 int f21 = flag2; Loop: [L709] COND TRUE f21 >= 3 [L711] f21 = flag2 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 100 PlacesBefore, 41 PlacesAfterwards, 113 TransitionsBefore, 46 TransitionsAfterwards, 3500 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 8 ChoiceCompositions, 82 TotalNumberOfCompositions, 7550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3393, positive: 3174, positive conditional: 0, positive unconditional: 3174, negative: 219, negative conditional: 0, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1697, positive: 1656, positive conditional: 0, positive unconditional: 1656, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3393, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 1697, unknown conditional: 0, unknown unconditional: 1697] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:34:11,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...