/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-semanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-atomic/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:10:23,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:10:23,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:10:23,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:10:23,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:10:23,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:10:23,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:10:23,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:10:23,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:10:23,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:10:23,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:10:23,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:10:23,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:10:23,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:10:23,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:10:23,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:10:23,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:10:23,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:10:23,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:10:23,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:10:23,615 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:10:23,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:10:23,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:10:23,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:10:23,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:10:23,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:10:23,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:10:23,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:10:23,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:10:23,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:10:23,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:10:23,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:10:23,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:10:23,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:10:23,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:10:23,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:10:23,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:10:23,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:10:23,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:10:23,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:10:23,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:10:23,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:10:23,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:10:23,708 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:10:23,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:10:23,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:10:23,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:10:23,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:10:23,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:10:23,711 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:10:23,712 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:10:23,712 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:10:23,713 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:10:23,713 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:10:23,713 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:10:23,713 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:10:23,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:10:23,714 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:10:23,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:10:23,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:10:23,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:10:23,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:10:23,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:10:23,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:10:23,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:10:23,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:10:23,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:10:23,716 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:10:23,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:10:23,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:10:23,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:10:23,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:10:23,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:10:23,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:10:23,720 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:10:23,720 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:10:24,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:10:24,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:10:24,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:10:24,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:10:24,143 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:10:24,145 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:10:24,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b08b7e/951e2f19ab9346eeb7683fde31e9a532/FLAGea9baf563 [2022-07-22 12:10:25,005 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:10:25,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2022-07-22 12:10:25,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b08b7e/951e2f19ab9346eeb7683fde31e9a532/FLAGea9baf563 [2022-07-22 12:10:25,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/945b08b7e/951e2f19ab9346eeb7683fde31e9a532 [2022-07-22 12:10:25,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:10:25,294 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:10:25,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:10:25,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:10:25,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:10:25,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b192cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25, skipping insertion in model container [2022-07-22 12:10:25,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:10:25,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:10:25,664 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:10:25,809 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:10:25,816 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:10:25,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:10:25,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:10:25,849 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-07-22 12:10:25,874 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:10:25,879 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:10:25,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:10:25,932 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:10:25,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25 WrapperNode [2022-07-22 12:10:25,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:10:25,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:10:25,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:10:25,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:10:25,943 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:10:25" (1/1) ... [2022-07-22 12:10:25,960 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:10:25" (1/1) ... [2022-07-22 12:10:25,986 INFO L137 Inliner]: procedures = 171, calls = 75, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-07-22 12:10:25,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:10:25,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:10:25,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:10:25,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:10:25,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:25,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:26,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:26,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:26,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:26,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:26,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:26,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:10:26,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:10:26,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:10:26,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:10:26,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (1/1) ... [2022-07-22 12:10:26,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:10:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:10:26,064 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:10:26,074 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:10:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:10:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-07-22 12:10:26,137 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-07-22 12:10:26,137 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-07-22 12:10:26,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-07-22 12:10:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:10:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:10:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:10:26,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:10:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:10:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:10:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:10:26,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:10:26,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:10:26,141 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:10:26,249 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:10:26,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:10:26,478 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:10:26,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:10:26,488 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 12:10:26,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:10:26 BoogieIcfgContainer [2022-07-22 12:10:26,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:10:26,493 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:10:26,493 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:10:26,501 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:10:26,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:10:26,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:10:25" (1/3) ... [2022-07-22 12:10:26,510 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d86163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:10:26, skipping insertion in model container [2022-07-22 12:10:26,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:10:26,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:10:25" (2/3) ... [2022-07-22 12:10:26,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d86163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:10:26, skipping insertion in model container [2022-07-22 12:10:26,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:10:26,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:10:26" (3/3) ... [2022-07-22 12:10:26,512 INFO L322 chiAutomizerObserver]: Analyzing ICFG szymanski.i [2022-07-22 12:10:26,645 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:10:26,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 117 transitions, 250 flow [2022-07-22 12:10:26,786 INFO L129 PetriNetUnfolder]: 20/113 cut-off events. [2022-07-22 12:10:26,786 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:10:26,794 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:10:26,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 117 transitions, 250 flow [2022-07-22 12:10:26,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 113 transitions, 238 flow [2022-07-22 12:10:26,816 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:10:26,837 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 113 transitions, 238 flow [2022-07-22 12:10:26,846 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 113 transitions, 238 flow [2022-07-22 12:10:26,847 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 113 transitions, 238 flow [2022-07-22 12:10:26,887 INFO L129 PetriNetUnfolder]: 20/113 cut-off events. [2022-07-22 12:10:26,887 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:10:26,890 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:10:26,895 INFO L116 LiptonReduction]: Number of co-enabled transitions 3500 [2022-07-22 12:10:29,244 INFO L131 LiptonReduction]: Checked pairs total: 6980 [2022-07-22 12:10:29,247 INFO L133 LiptonReduction]: Total number of compositions: 84 [2022-07-22 12:10:29,271 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:10:29,271 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:10:29,271 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:10:29,272 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:10:29,272 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:10:29,272 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:10:29,272 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:10:29,272 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:10:29,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:10:29,403 INFO L131 ngComponentsAnalysis]: Automaton has 184 accepting balls. 184 [2022-07-22 12:10:29,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:29,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:29,414 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:10:29,414 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:29,414 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:10:29,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 365 states, but on-demand construction may add more states [2022-07-22 12:10:29,442 INFO L131 ngComponentsAnalysis]: Automaton has 184 accepting balls. 184 [2022-07-22 12:10:29,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:29,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:29,443 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:10:29,443 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:29,452 INFO L748 eck$LassoCheckResult]: Stem: 105#[ULTIMATE.startENTRY]don't care [479] 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_~flag2~0_125 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)) (= v_~flag1~0_109 0) (= (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) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~x~0_87 0) (= (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_125, #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_109, #length=|v_#length_57|, ~x~0=v_~x~0_87, 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#[thr1ENTRY, L818-3]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_37 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_37, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 114#[L818-3, 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] 120#[L818-3, L712]don't care [2022-07-22 12:10:29,452 INFO L750 eck$LassoCheckResult]: Loop: 120#[L818-3, L712]don't care [445] L712-->L712: Formula: (and (= v_thr1Thread1of1ForFork0_~f21~0_73 v_~flag2~0_59) (<= 3 v_thr1Thread1of1ForFork0_~f21~0_74)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_74, ~flag2~0=v_~flag2~0_59} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_73, ~flag2~0=v_~flag2~0_59} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 120#[L818-3, L712]don't care [2022-07-22 12:10:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash 15581389, now seen corresponding path program 1 times [2022-07-22 12:10:29,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597259688] [2022-07-22 12:10:29,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,601 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash 476, now seen corresponding path program 1 times [2022-07-22 12:10:29,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197334152] [2022-07-22 12:10:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:29,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:29,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash 483023504, now seen corresponding path program 1 times [2022-07-22 12:10:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:29,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058602304] [2022-07-22 12:10:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:29,808 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:10:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:29,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058602304] [2022-07-22 12:10:29,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058602304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:29,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:29,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:10:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480795087] [2022-07-22 12:10:29,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:10:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:10:29,924 INFO L87 Difference]: Start difference. First operand currently 365 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:10:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:30,152 INFO L93 Difference]: Finished difference Result 556 states and 1610 transitions. [2022-07-22 12:10:30,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 556 states and 1610 transitions. [2022-07-22 12:10:30,166 INFO L131 ngComponentsAnalysis]: Automaton has 234 accepting balls. 234 [2022-07-22 12:10:30,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 556 states to 512 states and 1504 transitions. [2022-07-22 12:10:30,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 512 [2022-07-22 12:10:30,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2022-07-22 12:10:30,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 512 states and 1504 transitions. [2022-07-22 12:10:30,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:30,200 INFO L220 hiAutomatonCegarLoop]: Abstraction has 512 states and 1504 transitions. [2022-07-22 12:10:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states and 1504 transitions. [2022-07-22 12:10:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 390. [2022-07-22 12:10:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 390 states have (on average 2.982051282051282) internal successors, (1163), 389 states have internal predecessors, (1163), 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:10:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1163 transitions. [2022-07-22 12:10:30,343 INFO L242 hiAutomatonCegarLoop]: Abstraction has 390 states and 1163 transitions. [2022-07-22 12:10:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:10:30,350 INFO L425 stractBuchiCegarLoop]: Abstraction has 390 states and 1163 transitions. [2022-07-22 12:10:30,354 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:10:30,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 390 states and 1163 transitions. [2022-07-22 12:10:30,359 INFO L131 ngComponentsAnalysis]: Automaton has 186 accepting balls. 186 [2022-07-22 12:10:30,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:30,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:30,360 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:10:30,360 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:30,361 INFO L748 eck$LassoCheckResult]: Stem: 2111#[ULTIMATE.startENTRY]don't care [479] 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_~flag2~0_125 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)) (= v_~flag1~0_109 0) (= (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) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~x~0_87 0) (= (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_125, #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_109, #length=|v_#length_57|, ~x~0=v_~x~0_87, 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] 1595#[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] 1597#[thr1ENTRY, L818-3]don't care [472] 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] 2065#[thr1ENTRY, L819-3]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] 1941#[thr2ENTRY, L819-4, thr1ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5) (= v_~flag2~0_42 1)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_42, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 1753#[L762, L819-4, thr1ENTRY]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] 1755#[L769, L819-4, thr1ENTRY]don't care [2022-07-22 12:10:30,361 INFO L750 eck$LassoCheckResult]: Loop: 1755#[L769, L819-4, thr1ENTRY]don't care [431] L769-->L769: Formula: (and (<= 3 v_thr2Thread1of1ForFork1_~f12~0_60) (= v_~flag1~0_42 v_thr2Thread1of1ForFork1_~f12~0_59)) InVars {~flag1~0=v_~flag1~0_42, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_60} OutVars{~flag1~0=v_~flag1~0_42, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_59} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 1755#[L769, L819-4, thr1ENTRY]don't care [2022-07-22 12:10:30,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2090590801, now seen corresponding path program 1 times [2022-07-22 12:10:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149473108] [2022-07-22 12:10:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 462, now seen corresponding path program 1 times [2022-07-22 12:10:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879661427] [2022-07-22 12:10:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,421 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash 383805822, now seen corresponding path program 1 times [2022-07-22 12:10:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263142294] [2022-07-22 12:10:30,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:30,515 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:10:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:30,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263142294] [2022-07-22 12:10:30,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263142294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:30,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:30,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:10:30,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327698605] [2022-07-22 12:10:30,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:30,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:10:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:10:30,533 INFO L87 Difference]: Start difference. First operand 390 states and 1163 transitions. cyclomatic complexity: 959 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:10:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:30,694 INFO L93 Difference]: Finished difference Result 578 states and 1643 transitions. [2022-07-22 12:10:30,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 1643 transitions. [2022-07-22 12:10:30,706 INFO L131 ngComponentsAnalysis]: Automaton has 224 accepting balls. 224 [2022-07-22 12:10:30,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 516 states and 1478 transitions. [2022-07-22 12:10:30,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 516 [2022-07-22 12:10:30,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 516 [2022-07-22 12:10:30,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 516 states and 1478 transitions. [2022-07-22 12:10:30,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:30,739 INFO L220 hiAutomatonCegarLoop]: Abstraction has 516 states and 1478 transitions. [2022-07-22 12:10:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 1478 transitions. [2022-07-22 12:10:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 440. [2022-07-22 12:10:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 440 states have (on average 2.893181818181818) internal successors, (1273), 439 states have internal predecessors, (1273), 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:10:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1273 transitions. [2022-07-22 12:10:30,807 INFO L242 hiAutomatonCegarLoop]: Abstraction has 440 states and 1273 transitions. [2022-07-22 12:10:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:10:30,808 INFO L425 stractBuchiCegarLoop]: Abstraction has 440 states and 1273 transitions. [2022-07-22 12:10:30,809 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:10:30,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 440 states and 1273 transitions. [2022-07-22 12:10:30,815 INFO L131 ngComponentsAnalysis]: Automaton has 198 accepting balls. 198 [2022-07-22 12:10:30,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:30,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:30,816 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:10:30,816 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:30,818 INFO L748 eck$LassoCheckResult]: Stem: 3562#[ULTIMATE.startENTRY]don't care [479] 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_~flag2~0_125 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)) (= v_~flag1~0_109 0) (= (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) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~x~0_87 0) (= (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_125, #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_109, #length=|v_#length_57|, ~x~0=v_~x~0_87, 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] 2946#[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] 2948#[thr1ENTRY, L818-3]don't care [472] 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] 3446#[thr1ENTRY, L819-3]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] 3272#[thr2ENTRY, L819-4, thr1ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5) (= v_~flag2~0_42 1)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_42, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 3080#[L762, L819-4, 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_37 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_37, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 3010#[L762, L705, 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] 3012#[L705, L819-4, L769]don't care [2022-07-22 12:10:30,818 INFO L750 eck$LassoCheckResult]: Loop: 3012#[L705, L819-4, L769]don't care [431] L769-->L769: Formula: (and (<= 3 v_thr2Thread1of1ForFork1_~f12~0_60) (= v_~flag1~0_42 v_thr2Thread1of1ForFork1_~f12~0_59)) InVars {~flag1~0=v_~flag1~0_42, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_60} OutVars{~flag1~0=v_~flag1~0_42, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_59} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 3012#[L705, L819-4, L769]don't care [2022-07-22 12:10:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash 383808625, now seen corresponding path program 1 times [2022-07-22 12:10:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514493680] [2022-07-22 12:10:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,877 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,913 INFO L85 PathProgramCache]: Analyzing trace with hash 462, now seen corresponding path program 2 times [2022-07-22 12:10:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960442071] [2022-07-22 12:10:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:30,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:30,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -986834082, now seen corresponding path program 1 times [2022-07-22 12:10:30,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:30,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744188904] [2022-07-22 12:10:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:31,010 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:10:31,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:31,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744188904] [2022-07-22 12:10:31,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744188904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:31,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:31,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:10:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039755544] [2022-07-22 12:10:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:10:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:10:31,025 INFO L87 Difference]: Start difference. First operand 440 states and 1273 transitions. cyclomatic complexity: 1031 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:10:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:31,170 INFO L93 Difference]: Finished difference Result 580 states and 1621 transitions. [2022-07-22 12:10:31,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 1621 transitions. [2022-07-22 12:10:31,180 INFO L131 ngComponentsAnalysis]: Automaton has 234 accepting balls. 234 [2022-07-22 12:10:31,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 580 states and 1621 transitions. [2022-07-22 12:10:31,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 580 [2022-07-22 12:10:31,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 580 [2022-07-22 12:10:31,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 580 states and 1621 transitions. [2022-07-22 12:10:31,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:31,192 INFO L220 hiAutomatonCegarLoop]: Abstraction has 580 states and 1621 transitions. [2022-07-22 12:10:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states and 1621 transitions. [2022-07-22 12:10:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 456. [2022-07-22 12:10:31,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 456 states have (on average 2.848684210526316) internal successors, (1299), 455 states have internal predecessors, (1299), 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:10:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1299 transitions. [2022-07-22 12:10:31,213 INFO L242 hiAutomatonCegarLoop]: Abstraction has 456 states and 1299 transitions. [2022-07-22 12:10:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:10:31,214 INFO L425 stractBuchiCegarLoop]: Abstraction has 456 states and 1299 transitions. [2022-07-22 12:10:31,214 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:10:31,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 456 states and 1299 transitions. [2022-07-22 12:10:31,220 INFO L131 ngComponentsAnalysis]: Automaton has 192 accepting balls. 192 [2022-07-22 12:10:31,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:31,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:31,221 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:10:31,221 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:31,222 INFO L748 eck$LassoCheckResult]: Stem: 5037#[ULTIMATE.startENTRY]don't care [479] 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_~flag2~0_125 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)) (= v_~flag1~0_109 0) (= (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) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~x~0_87 0) (= (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_125, #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_109, #length=|v_#length_57|, ~x~0=v_~x~0_87, 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] 4417#[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] 4419#[thr1ENTRY, L818-3]don't care [472] 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] 4911#[thr1ENTRY, L819-3]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] 4737#[thr2ENTRY, L819-4, thr1ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5) (= v_~flag2~0_42 1)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_42, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 4553#[L762, L819-4, 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_37 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_37, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 4479#[L762, L705, L819-4]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] 4485#[L762, L819-4, L712]don't care [2022-07-22 12:10:31,222 INFO L750 eck$LassoCheckResult]: Loop: 4485#[L762, L819-4, L712]don't care [445] L712-->L712: Formula: (and (= v_thr1Thread1of1ForFork0_~f21~0_73 v_~flag2~0_59) (<= 3 v_thr1Thread1of1ForFork0_~f21~0_74)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_74, ~flag2~0=v_~flag2~0_59} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_73, ~flag2~0=v_~flag2~0_59} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 4485#[L762, L819-4, L712]don't care [2022-07-22 12:10:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash 383808660, now seen corresponding path program 1 times [2022-07-22 12:10:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:31,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008036694] [2022-07-22 12:10:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:31,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:31,254 INFO L85 PathProgramCache]: Analyzing trace with hash 476, now seen corresponding path program 2 times [2022-07-22 12:10:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:31,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531643359] [2022-07-22 12:10:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -986832983, now seen corresponding path program 1 times [2022-07-22 12:10:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:31,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122331783] [2022-07-22 12:10:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:10:31,296 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:10:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:10:31,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122331783] [2022-07-22 12:10:31,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122331783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:10:31,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:10:31,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:10:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619928479] [2022-07-22 12:10:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:10:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:10:31,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:10:31,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:10:31,309 INFO L87 Difference]: Start difference. First operand 456 states and 1299 transitions. cyclomatic complexity: 1035 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:10:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:10:31,450 INFO L93 Difference]: Finished difference Result 632 states and 1760 transitions. [2022-07-22 12:10:31,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 632 states and 1760 transitions. [2022-07-22 12:10:31,463 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 256 [2022-07-22 12:10:31,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 632 states to 632 states and 1760 transitions. [2022-07-22 12:10:31,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 632 [2022-07-22 12:10:31,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 632 [2022-07-22 12:10:31,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 632 states and 1760 transitions. [2022-07-22 12:10:31,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:10:31,478 INFO L220 hiAutomatonCegarLoop]: Abstraction has 632 states and 1760 transitions. [2022-07-22 12:10:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states and 1760 transitions. [2022-07-22 12:10:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 520. [2022-07-22 12:10:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 520 states have (on average 2.7826923076923076) internal successors, (1447), 519 states have internal predecessors, (1447), 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:10:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1447 transitions. [2022-07-22 12:10:31,504 INFO L242 hiAutomatonCegarLoop]: Abstraction has 520 states and 1447 transitions. [2022-07-22 12:10:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:10:31,505 INFO L425 stractBuchiCegarLoop]: Abstraction has 520 states and 1447 transitions. [2022-07-22 12:10:31,505 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:10:31,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 1447 transitions. [2022-07-22 12:10:31,510 INFO L131 ngComponentsAnalysis]: Automaton has 218 accepting balls. 218 [2022-07-22 12:10:31,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:10:31,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:10:31,511 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:10:31,511 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:10:31,512 INFO L748 eck$LassoCheckResult]: Stem: 6626#[ULTIMATE.startENTRY]don't care [479] 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_~flag2~0_125 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)) (= v_~flag1~0_109 0) (= (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) (= (select .cse0 1) 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_29| 0) (= |v_#NULL.offset_10| 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= v_~x~0_87 0) (= (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_125, #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_109, #length=|v_#length_57|, ~x~0=v_~x~0_87, 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] 5964#[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] 5966#[thr1ENTRY, L818-3]don't care [472] 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] 6492#[thr1ENTRY, L819-3]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] 6290#[thr2ENTRY, L819-4, thr1ENTRY]don't care [424] thr2ENTRY-->L762: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_5 |v_thr2Thread1of1ForFork1_#in~_.offset_5|) (= |v_thr2Thread1of1ForFork1_#in~_.base_5| v_thr2Thread1of1ForFork1_~_.base_5) (= v_~flag2~0_42 1)) InVars {thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_5, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_5|, ~flag2~0=v_~flag2~0_42, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_5|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_5} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, ~flag2~0, thr2Thread1of1ForFork1_~_.base] 6104#[L762, L819-4, thr1ENTRY]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] 6106#[L769, L819-4, thr1ENTRY]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] 6392#[L773, L819-4, 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_37 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_37, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_5|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, ~flag1~0, thr1Thread1of1ForFork0_~_.offset] 6426#[L773, L705, L819-4]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] 6428#[L773, L819-4, L712]don't care [2022-07-22 12:10:31,512 INFO L750 eck$LassoCheckResult]: Loop: 6428#[L773, L819-4, L712]don't care [445] L712-->L712: Formula: (and (= v_thr1Thread1of1ForFork0_~f21~0_73 v_~flag2~0_59) (<= 3 v_thr1Thread1of1ForFork0_~f21~0_74)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_74, ~flag2~0=v_~flag2~0_59} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_73, ~flag2~0=v_~flag2~0_59} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 6428#[L773, L819-4, L712]don't care [2022-07-22 12:10:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash -529760105, now seen corresponding path program 1 times [2022-07-22 12:10:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:31,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005107152] [2022-07-22 12:10:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,529 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:31,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash 476, now seen corresponding path program 3 times [2022-07-22 12:10:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:31,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737337969] [2022-07-22 12:10:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:31,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:10:31,554 INFO L85 PathProgramCache]: Analyzing trace with hash 757306374, now seen corresponding path program 1 times [2022-07-22 12:10:31,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:10:31,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431475721] [2022-07-22 12:10:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:10:31,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:10:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,568 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:10:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:10:31,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:10:32,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:10:32 BoogieIcfgContainer [2022-07-22 12:10:32,569 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:10:32,570 INFO L158 Benchmark]: Toolchain (without parser) took 7280.37ms. Allocated memory was 169.9MB in the beginning and 208.7MB in the end (delta: 38.8MB). Free memory was 141.6MB in the beginning and 153.9MB in the end (delta: -12.3MB). Peak memory consumption was 115.9MB. Max. memory is 8.0GB. [2022-07-22 12:10:32,571 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 169.9MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:10:32,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 637.91ms. Allocated memory is still 169.9MB. Free memory was 141.5MB in the beginning and 121.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-07-22 12:10:32,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.11ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 119.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:10:32,573 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 118.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:10:32,574 INFO L158 Benchmark]: RCFGBuilder took 470.50ms. Allocated memory is still 169.9MB. Free memory was 118.1MB in the beginning and 140.2MB in the end (delta: -22.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-07-22 12:10:32,575 INFO L158 Benchmark]: BuchiAutomizer took 6075.98ms. Allocated memory was 169.9MB in the beginning and 208.7MB in the end (delta: 38.8MB). Free memory was 140.2MB in the beginning and 153.9MB in the end (delta: -13.8MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. [2022-07-22 12:10:32,579 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 169.9MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 637.91ms. Allocated memory is still 169.9MB. Free memory was 141.5MB in the beginning and 121.6MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.11ms. Allocated memory is still 169.9MB. Free memory was 121.6MB in the beginning and 119.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 118.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 470.50ms. Allocated memory is still 169.9MB. Free memory was 118.1MB in the beginning and 140.2MB in the end (delta: -22.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6075.98ms. Allocated memory was 169.9MB in the beginning and 208.7MB in the end (delta: 38.8MB). Free memory was 140.2MB in the beginning and 153.9MB in the end (delta: -13.8MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 520 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.4s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 434 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, 202 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 594 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 61 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.5s - 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:0}, \result=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@32d42808 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cda1d6d in36002,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2fe88ca7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@8620aca=0, t1={29574:0}, t2={29575: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.4s, 100 PlacesBefore, 39 PlacesAfterwards, 113 TransitionsBefore, 44 TransitionsAfterwards, 3500 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 8 ChoiceCompositions, 84 TotalNumberOfCompositions, 6980 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3211, positive: 3014, positive conditional: 0, positive unconditional: 3014, negative: 197, negative conditional: 0, negative unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2268, positive: 2216, positive conditional: 0, positive unconditional: 2216, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2268, positive: 2211, positive conditional: 0, positive unconditional: 2211, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3211, positive: 798, positive conditional: 0, positive unconditional: 798, negative: 145, negative conditional: 0, negative unconditional: 145, unknown: 2268, unknown conditional: 0, unknown unconditional: 2268] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 160, Positive conditional cache size: 0, Positive unconditional cache size: 160, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:10:32,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...