/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:53:01,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:53:01,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:53:01,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:53:01,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:53:01,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:53:01,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:53:01,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:53:01,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:53:01,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:53:01,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:53:01,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:53:01,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:53:01,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:53:01,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:53:01,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:53:01,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:53:01,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:53:01,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:53:01,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:53:01,740 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:53:01,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:53:01,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:53:01,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:53:01,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:53:01,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:53:01,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:53:01,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:53:01,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:53:01,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:53:01,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:53:01,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:53:01,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:53:01,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:53:01,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:53:01,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:53:01,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:53:01,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:53:01,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:53:01,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:53:01,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:53:01,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:53:01,782 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:53:01,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:53:01,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:53:01,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:53:01,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:53:01,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:53:01,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:53:01,842 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:53:01,843 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:53:01,843 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:53:01,844 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:53:01,844 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:53:01,845 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:53:01,845 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:53:01,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:53:01,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:53:01,846 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:53:01,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:53:01,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:53:01,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:53:01,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:53:01,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:53:01,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:53:01,847 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:53:01,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:53:01,847 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:53:01,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:53:01,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:53:01,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:53:01,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:53:01,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:53:01,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:53:01,850 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:53:01,852 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:53:01,853 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:53:02,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:53:02,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:53:02,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:53:02,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:53:02,303 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:53:02,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-07-22 12:53:02,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34b8e6c5/7e2387723b0a45ae93911aa601448ade/FLAG5acd8e7f2 [2022-07-22 12:53:03,187 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:53:03,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-07-22 12:53:03,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34b8e6c5/7e2387723b0a45ae93911aa601448ade/FLAG5acd8e7f2 [2022-07-22 12:53:03,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a34b8e6c5/7e2387723b0a45ae93911aa601448ade [2022-07-22 12:53:03,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:53:03,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:53:03,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:53:03,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:53:03,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:53:03,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:53:03" (1/1) ... [2022-07-22 12:53:03,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1760a7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:03, skipping insertion in model container [2022-07-22 12:53:03,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:53:03" (1/1) ... [2022-07-22 12:53:03,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:53:03,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:53:04,022 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-deagle/arithmetic_prog_bad.i[39758,39771] [2022-07-22 12:53:04,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:53:04,050 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:53:04,139 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-deagle/arithmetic_prog_bad.i[39758,39771] [2022-07-22 12:53:04,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:53:04,252 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:53:04,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04 WrapperNode [2022-07-22 12:53:04,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:53:04,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:53:04,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:53:04,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:53:04,264 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:53:04" (1/1) ... [2022-07-22 12:53:04,284 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:53:04" (1/1) ... [2022-07-22 12:53:04,314 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-07-22 12:53:04,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:53:04,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:53:04,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:53:04,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:53:04,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:53:04,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:53:04,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:53:04,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:53:04,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:04,398 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:53:04,417 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:53:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:53:04,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:53:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 12:53:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:53:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:53:04,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:53:04,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:53:04,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:53:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:53:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-22 12:53:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:53:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:53:04,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:53:04,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:53:04,470 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:53:04,602 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:53:04,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:53:04,925 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:53:04,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:53:04,941 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:53:04,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:53:04 BoogieIcfgContainer [2022-07-22 12:53:04,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:53:04,948 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:53:04,948 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:53:04,960 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:53:04,961 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:53:04,961 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:53:03" (1/3) ... [2022-07-22 12:53:04,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5555962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:53:04, skipping insertion in model container [2022-07-22 12:53:04,963 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:53:04,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (2/3) ... [2022-07-22 12:53:04,964 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5555962a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:53:04, skipping insertion in model container [2022-07-22 12:53:04,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:53:04,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:53:04" (3/3) ... [2022-07-22 12:53:04,966 INFO L322 chiAutomizerObserver]: Analyzing ICFG arithmetic_prog_bad.i [2022-07-22 12:53:05,075 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:53:05,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 136 transitions, 288 flow [2022-07-22 12:53:05,223 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-22 12:53:05,223 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:53:05,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 132 events. 10/132 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2022-07-22 12:53:05,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 136 transitions, 288 flow [2022-07-22 12:53:05,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,262 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:53:05,281 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,285 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,355 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-22 12:53:05,356 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:53:05,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 132 events. 10/132 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2022-07-22 12:53:05,362 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2022-07-22 12:53:13,425 INFO L131 LiptonReduction]: Checked pairs total: 4371 [2022-07-22 12:53:13,425 INFO L133 LiptonReduction]: Total number of compositions: 114 [2022-07-22 12:53:13,448 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:53:13,448 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:53:13,448 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:53:13,448 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:53:13,448 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:53:13,449 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:53:13,449 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:53:13,449 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:53:13,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:53:13,557 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:13,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:13,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:13,567 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:53:13,567 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:53:13,567 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:53:13,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 221 states, but on-demand construction may add more states [2022-07-22 12:53:13,594 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:13,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:13,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:13,595 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:53:13,596 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:53:13,603 INFO L748 eck$LassoCheckResult]: Stem: 134#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 137#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 139#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 143#[L913-4, L878-2]don't care [2022-07-22 12:53:13,610 INFO L750 eck$LassoCheckResult]: Loop: 143#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 3))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 149#[L913-4, L880-2]don't care [448] L880-2-->L882-1: Formula: false InVars {} OutVars{thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_13|, ~num~0=v_~num~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post6, ~num~0] 163#[L882-1, L913-4]don't care [396] L882-1-->L885: Formula: (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_33| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_33|) |v_~#m~0.offset_33| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_9|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~post6] 189#[L885, L913-4]don't care [436] L885-->L878-2: Formula: (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post7] 143#[L913-4, L878-2]don't care [2022-07-22 12:53:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 503789, now seen corresponding path program 1 times [2022-07-22 12:53:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:13,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105382436] [2022-07-22 12:53:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:13,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash 14772711, now seen corresponding path program 1 times [2022-07-22 12:53:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:13,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854937000] [2022-07-22 12:53:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:13,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:13,999 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:53:14,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:53:14,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854937000] [2022-07-22 12:53:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854937000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:53:14,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:53:14,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:53:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17613273] [2022-07-22 12:53:14,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:53:14,012 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-07-22 12:53:14,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:53:14,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 12:53:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 12:53:14,053 INFO L87 Difference]: Start difference. First operand currently 221 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:53:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:53:14,119 INFO L93 Difference]: Finished difference Result 222 states and 572 transitions. [2022-07-22 12:53:14,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 572 transitions. [2022-07-22 12:53:14,125 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:14,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 216 states and 561 transitions. [2022-07-22 12:53:14,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2022-07-22 12:53:14,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2022-07-22 12:53:14,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 561 transitions. [2022-07-22 12:53:14,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:53:14,143 INFO L220 hiAutomatonCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-22 12:53:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 561 transitions. [2022-07-22 12:53:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-22 12:53:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 216 states have (on average 2.5972222222222223) internal successors, (561), 215 states have internal predecessors, (561), 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:53:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 561 transitions. [2022-07-22 12:53:14,220 INFO L242 hiAutomatonCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-22 12:53:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 12:53:14,226 INFO L425 stractBuchiCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-22 12:53:14,226 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:53:14,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 561 transitions. [2022-07-22 12:53:14,230 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:14,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:14,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:14,231 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:53:14,231 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:53:14,232 INFO L748 eck$LassoCheckResult]: Stem: 1236#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 1182#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 1184#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 898#[L913-4, L878-2]don't care [2022-07-22 12:53:14,233 INFO L750 eck$LassoCheckResult]: Loop: 898#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 3))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 902#[L913-4, L880-2]don't care [322] L880-2-->L880-3: Formula: (not (< 0 v_~num~0_1)) InVars {~num~0=v_~num~0_1} OutVars{~num~0=v_~num~0_1} AuxVars[] AssignedVars[] 946#[L880-3, L913-4]don't care [324] L880-3-->L882: Formula: (= |v_thread1Thread1of1ForFork1_#t~post6_1| v_~num~0_3) InVars {~num~0=v_~num~0_3} OutVars{~num~0=v_~num~0_3, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post6] 950#[L913-4, L882]don't care [326] L882-->L882-1: Formula: (= v_~num~0_4 (+ |v_thread1Thread1of1ForFork1_#t~post6_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} OutVars{~num~0=v_~num~0_4, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} AuxVars[] AssignedVars[~num~0] 1064#[L882-1, L913-4]don't care [396] L882-1-->L885: Formula: (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_33| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_33|) |v_~#m~0.offset_33| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_9|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~post6] 1068#[L885, L913-4]don't care [436] L885-->L878-2: Formula: (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post7] 898#[L913-4, L878-2]don't care [2022-07-22 12:53:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash 503789, now seen corresponding path program 2 times [2022-07-22 12:53:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:14,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838975264] [2022-07-22 12:53:14,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:14,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:14,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1193071787, now seen corresponding path program 1 times [2022-07-22 12:53:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:14,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394302519] [2022-07-22 12:53:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:14,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:14,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 212067223, now seen corresponding path program 1 times [2022-07-22 12:53:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:14,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196238284] [2022-07-22 12:53:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:14,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:14,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:16,354 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:53:16,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:53:16,355 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:53:16,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:53:16,356 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:53:16,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:16,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:53:16,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:53:16,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: arithmetic_prog_bad.i_BEv2_Iteration2_Lasso [2022-07-22 12:53:16,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:53:16,357 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:53:16,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:16,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:21,040 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:53:21,046 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:53:21,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:21,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:21,056 INFO L229 MonitoredProcess]: Starting monitored process 2 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:53:21,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:21,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:53:21,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:21,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:21,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:21,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:21,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:21,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:21,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:21,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:21,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:21,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:21,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:21,125 INFO L229 MonitoredProcess]: Starting monitored process 3 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:53:21,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:53:21,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:21,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:21,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:21,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:21,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:21,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:21,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:21,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:21,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:21,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:21,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:21,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:21,183 INFO L229 MonitoredProcess]: Starting monitored process 4 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:53:21,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:53:21,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:21,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:21,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:21,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:21,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:21,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:21,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:21,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:21,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:21,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:21,254 INFO L229 MonitoredProcess]: Starting monitored process 5 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:53:21,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:21,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:21,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:21,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:21,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:21,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:21,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:21,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:21,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:53:21,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:21,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:21,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:21,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:21,324 INFO L229 MonitoredProcess]: Starting monitored process 6 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:53:21,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:21,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:21,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:21,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:21,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:21,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:21,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:21,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:53:21,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:53:21,384 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 12:53:21,384 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-22 12:53:21,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:21,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:21,389 INFO L229 MonitoredProcess]: Starting monitored process 7 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:53:21,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:53:21,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:53:21,427 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:53:21,427 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:53:21,428 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0) = -2*thread1Thread1of1ForFork1_~i~0 + 5 Supporting invariants [] [2022-07-22 12:53:21,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:22,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:25,854 INFO L257 tatePredicateManager]: 351 out of 351 supporting invariants were superfluous and have been removed [2022-07-22 12:53:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:25,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:53:25,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:25,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:53:25,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:25,963 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:53:25,968 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:53:25,970 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 216 states and 561 transitions. cyclomatic complexity: 359 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:53:26,143 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 216 states and 561 transitions. cyclomatic complexity: 359. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) Result 584 states and 1627 transitions. Complement of second has 5 states. [2022-07-22 12:53:26,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:53:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:53:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-07-22 12:53:26,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-22 12:53:26,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:26,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-22 12:53:26,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:26,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 3 letters. Loop has 12 letters. [2022-07-22 12:53:26,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:26,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 1627 transitions. [2022-07-22 12:53:26,159 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 310 [2022-07-22 12:53:26,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 576 states and 1605 transitions. [2022-07-22 12:53:26,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2022-07-22 12:53:26,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2022-07-22 12:53:26,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 576 states and 1605 transitions. [2022-07-22 12:53:26,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:53:26,175 INFO L220 hiAutomatonCegarLoop]: Abstraction has 576 states and 1605 transitions. [2022-07-22 12:53:26,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states and 1605 transitions. [2022-07-22 12:53:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 520. [2022-07-22 12:53:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 520 states have (on average 2.7596153846153846) internal successors, (1435), 519 states have internal predecessors, (1435), 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:53:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1435 transitions. [2022-07-22 12:53:26,221 INFO L242 hiAutomatonCegarLoop]: Abstraction has 520 states and 1435 transitions. [2022-07-22 12:53:26,221 INFO L425 stractBuchiCegarLoop]: Abstraction has 520 states and 1435 transitions. [2022-07-22 12:53:26,221 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:53:26,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 1435 transitions. [2022-07-22 12:53:26,241 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 310 [2022-07-22 12:53:26,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:26,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:26,242 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:53:26,242 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:53:26,244 INFO L748 eck$LassoCheckResult]: Stem: 4095#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 3937#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 3939#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 3423#[L913-4, L878-2]don't care [466] L913-4-->L914-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|))) |v_#memory_$Pointer$.base_16|) (= |v_ULTIMATE.start_main_#t~pre14#1_21| |v_#pthreadsForks_24|) (= (select |v_#valid_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#memory_$Pointer$.offset_16| (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|)))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre14#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_66| |v_ULTIMATE.start_main_~#t2~0#1.base_31|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_98|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_21|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, #memory_$Pointer$.base, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1, #memory_$Pointer$.offset] 3425#[L914-3, L878-2]don't care [2022-07-22 12:53:26,244 INFO L750 eck$LassoCheckResult]: Loop: 3425#[L914-3, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 3))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 4205#[L914-3, L880-2]don't care [322] L880-2-->L880-3: Formula: (not (< 0 v_~num~0_1)) InVars {~num~0=v_~num~0_1} OutVars{~num~0=v_~num~0_1} AuxVars[] AssignedVars[] 4175#[L914-3, L880-3]don't care [324] L880-3-->L882: Formula: (= |v_thread1Thread1of1ForFork1_#t~post6_1| v_~num~0_3) InVars {~num~0=v_~num~0_3} OutVars{~num~0=v_~num~0_3, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post6] 4177#[L914-3, L882]don't care [326] L882-->L882-1: Formula: (= v_~num~0_4 (+ |v_thread1Thread1of1ForFork1_#t~post6_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} OutVars{~num~0=v_~num~0_4, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} AuxVars[] AssignedVars[~num~0] 4277#[L914-3, L882-1]don't care [396] L882-1-->L885: Formula: (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_33| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_33|) |v_~#m~0.offset_33| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_9|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~post6] 4311#[L914-3, L885]don't care [436] L885-->L878-2: Formula: (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post7] 3425#[L914-3, L878-2]don't care [2022-07-22 12:53:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash 15617925, now seen corresponding path program 1 times [2022-07-22 12:53:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:26,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054345367] [2022-07-22 12:53:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:26,267 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:26,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:26,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1193071787, now seen corresponding path program 2 times [2022-07-22 12:53:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:26,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597807638] [2022-07-22 12:53:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:26,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:26,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:26,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1333104337, now seen corresponding path program 1 times [2022-07-22 12:53:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:26,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466538671] [2022-07-22 12:53:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:26,339 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:26,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:28,736 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:53:28,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:53:28,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:53:28,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:53:28,736 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:53:28,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:28,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:53:28,737 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:53:28,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: arithmetic_prog_bad.i_BEv2_Iteration3_Lasso [2022-07-22 12:53:28,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:53:28,737 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:53:28,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:28,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:33,874 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:53:33,874 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:53:33,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:33,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:33,880 INFO L229 MonitoredProcess]: Starting monitored process 8 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:53:33,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:33,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:33,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:33,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:33,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:33,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:33,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:33,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:33,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:53:33,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:33,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:33,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:33,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:33,934 INFO L229 MonitoredProcess]: Starting monitored process 9 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:53:33,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:53:33,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:33,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:33,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:33,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:33,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:33,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:33,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:33,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:33,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:33,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:33,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:33,972 INFO L229 MonitoredProcess]: Starting monitored process 10 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:53:33,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:53:33,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:33,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:33,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:33,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:33,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:33,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:33,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:33,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:34,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:34,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:34,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:34,009 INFO L229 MonitoredProcess]: Starting monitored process 11 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:53:34,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:53:34,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:34,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:34,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:34,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:34,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:34,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:34,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:34,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:34,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:34,050 INFO L229 MonitoredProcess]: Starting monitored process 12 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:53:34,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:53:34,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:34,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:34,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:34,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:34,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:34,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:34,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:34,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:34,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 12:53:34,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:34,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:34,091 INFO L229 MonitoredProcess]: Starting monitored process 13 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:53:34,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:53:34,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:34,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:34,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:34,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:34,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:34,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:34,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:34,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:34,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:34,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:34,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:34,127 INFO L229 MonitoredProcess]: Starting monitored process 14 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:53:34,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:53:34,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:34,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:34,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:34,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:34,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:34,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:34,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:34,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:34,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:34,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:34,165 INFO L229 MonitoredProcess]: Starting monitored process 15 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:53:34,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:53:34,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:34,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:34,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:34,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:34,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:34,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:34,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:34,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:34,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:34,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:34,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:34,211 INFO L229 MonitoredProcess]: Starting monitored process 16 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:53:34,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:53:34,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:34,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:34,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:34,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:34,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:34,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:34,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:34,226 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:53:34,236 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:53:34,236 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-22 12:53:34,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:34,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:34,237 INFO L229 MonitoredProcess]: Starting monitored process 17 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:53:34,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:53:34,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:53:34,250 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:53:34,250 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:53:34,250 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0) = -2*thread1Thread1of1ForFork1_~i~0 + 5 Supporting invariants [] [2022-07-22 12:53:34,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:34,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:38,485 INFO L257 tatePredicateManager]: 381 out of 381 supporting invariants were superfluous and have been removed [2022-07-22 12:53:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:38,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:53:38,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:38,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:53:38,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:38,571 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:53:38,572 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:53:38,572 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 520 states and 1435 transitions. cyclomatic complexity: 952 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:38,672 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 520 states and 1435 transitions. cyclomatic complexity: 952. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 881 states and 2442 transitions. Complement of second has 5 states. [2022-07-22 12:53:38,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:53:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-07-22 12:53:38,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-22 12:53:38,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:38,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-22 12:53:38,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:38,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 12 letters. [2022-07-22 12:53:38,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:38,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 881 states and 2442 transitions. [2022-07-22 12:53:38,686 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 415 [2022-07-22 12:53:38,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 881 states to 873 states and 2420 transitions. [2022-07-22 12:53:38,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 484 [2022-07-22 12:53:38,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 553 [2022-07-22 12:53:38,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 873 states and 2420 transitions. [2022-07-22 12:53:38,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:53:38,703 INFO L220 hiAutomatonCegarLoop]: Abstraction has 873 states and 2420 transitions. [2022-07-22 12:53:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states and 2420 transitions. [2022-07-22 12:53:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 512. [2022-07-22 12:53:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 512 states have (on average 2.767578125) internal successors, (1417), 511 states have internal predecessors, (1417), 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:53:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1417 transitions. [2022-07-22 12:53:38,770 INFO L242 hiAutomatonCegarLoop]: Abstraction has 512 states and 1417 transitions. [2022-07-22 12:53:38,770 INFO L425 stractBuchiCegarLoop]: Abstraction has 512 states and 1417 transitions. [2022-07-22 12:53:38,770 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:53:38,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 512 states and 1417 transitions. [2022-07-22 12:53:38,779 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 302 [2022-07-22 12:53:38,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:38,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:38,780 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:53:38,780 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:53:38,785 INFO L748 eck$LassoCheckResult]: Stem: 7550#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 7424#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 7426#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 6916#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 3))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 6922#[L913-4, L880-2]don't care [2022-07-22 12:53:38,785 INFO L750 eck$LassoCheckResult]: Loop: 6922#[L913-4, L880-2]don't care [323] L880-2-->L881: Formula: (< 0 v_~num~0_2) InVars {~num~0=v_~num~0_2} OutVars{~num~0=v_~num~0_2} AuxVars[] AssignedVars[] 7078#[L881, L913-4]don't care [325] L881-->L881-1: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#m~0.base_3| (store (select |v_#pthreadsMutex_6| |v_~#m~0.base_3|) |v_~#m~0.offset_3| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#m~0.base=|v_~#m~0.base_3|, ~#m~0.offset=|v_~#m~0.offset_3|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#m~0.base=|v_~#m~0.base_3|, ~#m~0.offset=|v_~#m~0.offset_3|} AuxVars[] AssignedVars[#pthreadsMutex] 7080#[L881-1, L913-4]don't care [383] L881-1-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_20| |v_~#m~0.base_25|))) (and (= (select .cse0 |v_~#m~0.offset_25|) 0) (= (store |v_#pthreadsMutex_20| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1)) |v_#pthreadsMutex_19|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_7|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~nondet5] 6922#[L913-4, L880-2]don't care [2022-07-22 12:53:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 15617909, now seen corresponding path program 1 times [2022-07-22 12:53:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:38,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330429126] [2022-07-22 12:53:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:38,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:38,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash 350652, now seen corresponding path program 1 times [2022-07-22 12:53:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:38,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075342193] [2022-07-22 12:53:38,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:38,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:38,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:38,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:38,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1416979912, now seen corresponding path program 1 times [2022-07-22 12:53:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:38,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190403787] [2022-07-22 12:53:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:38,963 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:53:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:53:38,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190403787] [2022-07-22 12:53:38,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190403787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:53:38,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:53:38,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:53:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994705490] [2022-07-22 12:53:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:53:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:53:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:53:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:53:38,992 INFO L87 Difference]: Start difference. First operand 512 states and 1417 transitions. cyclomatic complexity: 941 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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:53:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:53:39,068 INFO L93 Difference]: Finished difference Result 730 states and 1939 transitions. [2022-07-22 12:53:39,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 730 states and 1939 transitions. [2022-07-22 12:53:39,078 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 372 [2022-07-22 12:53:39,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 730 states to 728 states and 1934 transitions. [2022-07-22 12:53:39,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 495 [2022-07-22 12:53:39,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 495 [2022-07-22 12:53:39,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 728 states and 1934 transitions. [2022-07-22 12:53:39,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:53:39,090 INFO L220 hiAutomatonCegarLoop]: Abstraction has 728 states and 1934 transitions. [2022-07-22 12:53:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states and 1934 transitions. [2022-07-22 12:53:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 720. [2022-07-22 12:53:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 720 states have (on average 2.6694444444444443) internal successors, (1922), 719 states have internal predecessors, (1922), 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:53:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1922 transitions. [2022-07-22 12:53:39,120 INFO L242 hiAutomatonCegarLoop]: Abstraction has 720 states and 1922 transitions. [2022-07-22 12:53:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:53:39,121 INFO L425 stractBuchiCegarLoop]: Abstraction has 720 states and 1922 transitions. [2022-07-22 12:53:39,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:53:39,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 720 states and 1922 transitions. [2022-07-22 12:53:39,127 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 372 [2022-07-22 12:53:39,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:39,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:39,128 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:53:39,128 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:53:39,129 INFO L748 eck$LassoCheckResult]: Stem: 9464#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 9218#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 9220#[L913-4, thread1ENTRY]don't care [466] L913-4-->L914-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|))) |v_#memory_$Pointer$.base_16|) (= |v_ULTIMATE.start_main_#t~pre14#1_21| |v_#pthreadsForks_24|) (= (select |v_#valid_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#memory_$Pointer$.offset_16| (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|)))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre14#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_66| |v_ULTIMATE.start_main_~#t2~0#1.base_31|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_98|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_21|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, #memory_$Pointer$.base, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1, #memory_$Pointer$.offset] 9340#[L914-3, thread1ENTRY]don't care [362] L914-3-->thread2ENTRY: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_4, thread2Thread1of1ForFork0_#t~nondet8=|v_thread2Thread1of1ForFork0_#t~nondet8_6|, thread2Thread1of1ForFork0_#t~post10=|v_thread2Thread1of1ForFork0_#t~post10_8|, thread2Thread1of1ForFork0_#t~post11=|v_thread2Thread1of1ForFork0_#t~post11_8|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_18, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork0_#t~nondet9=|v_thread2Thread1of1ForFork0_#t~nondet9_6|, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_#t~nondet8, thread2Thread1of1ForFork0_#t~post10, thread2Thread1of1ForFork0_#t~post11, thread2Thread1of1ForFork0_~j~0, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_#t~nondet9, thread2Thread1of1ForFork0_#in~arg.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#in~arg.base] 9364#[thread2ENTRY, thread1ENTRY, L914-4]don't care [452] thread2ENTRY-->L892-2: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~arg.base_7| v_thread2Thread1of1ForFork0_~arg.base_7) (= v_thread2Thread1of1ForFork0_~j~0_41 0) (= |v_thread2Thread1of1ForFork0_#in~arg.offset_7| v_thread2Thread1of1ForFork0_~arg.offset_7)) InVars {thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_7|, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_7|} OutVars{thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_7, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_7, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_7|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_41, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_~j~0] 9366#[L892-2, thread1ENTRY, L914-4]don't care [449] L892-2-->L894-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_52| |v_~#m~0.base_49|))) (and (= (select .cse0 |v_~#m~0.offset_49|) 0) (< v_thread2Thread1of1ForFork0_~j~0_39 3) (= |v_#pthreadsMutex_51| (store |v_#pthreadsMutex_52| |v_~#m~0.base_49| (store .cse0 |v_~#m~0.offset_49| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_52|, ~#m~0.base=|v_~#m~0.base_49|, ~#m~0.offset=|v_~#m~0.offset_49|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_39} OutVars{#pthreadsMutex=|v_#pthreadsMutex_51|, ~#m~0.base=|v_~#m~0.base_49|, ~#m~0.offset=|v_~#m~0.offset_49|, thread2Thread1of1ForFork0_#t~nondet8=|v_thread2Thread1of1ForFork0_#t~nondet8_11|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_39} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet8] 9222#[thread1ENTRY, L894-2, L914-4]don't care [2022-07-22 12:53:39,129 INFO L750 eck$LassoCheckResult]: Loop: 9222#[thread1ENTRY, L894-2, L914-4]don't care [347] L894-2-->L895: Formula: (= v_~num~0_8 0) InVars {~num~0=v_~num~0_8} OutVars{~num~0=v_~num~0_8} AuxVars[] AssignedVars[] 8582#[L895, thread1ENTRY, L914-4]don't care [350] L895-->L895-1: Formula: (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#m~0.base_5| (store (select |v_#pthreadsMutex_10| |v_~#m~0.base_5|) |v_~#m~0.offset_5| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#m~0.base=|v_~#m~0.base_5|, ~#m~0.offset=|v_~#m~0.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#m~0.base=|v_~#m~0.base_5|, ~#m~0.offset=|v_~#m~0.offset_5|} AuxVars[] AssignedVars[#pthreadsMutex] 8588#[L895-1, thread1ENTRY, L914-4]don't care [401] L895-1-->L894-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_36| |v_~#m~0.base_35|))) (and (= (select .cse0 |v_~#m~0.offset_35|) 0) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_35| (store .cse0 |v_~#m~0.offset_35| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_35|, ~#m~0.offset=|v_~#m~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_35|, thread2Thread1of1ForFork0_#t~nondet9=|v_thread2Thread1of1ForFork0_#t~nondet9_7|, ~#m~0.offset=|v_~#m~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet9] 9222#[thread1ENTRY, L894-2, L914-4]don't care [2022-07-22 12:53:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2124553538, now seen corresponding path program 1 times [2022-07-22 12:53:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:39,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198185151] [2022-07-22 12:53:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:39,150 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:39,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:39,169 INFO L85 PathProgramCache]: Analyzing trace with hash 374509, now seen corresponding path program 1 times [2022-07-22 12:53:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:39,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119170082] [2022-07-22 12:53:39,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:39,175 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:39,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1936721420, now seen corresponding path program 1 times [2022-07-22 12:53:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:39,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585700652] [2022-07-22 12:53:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:39,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:39,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:43,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:53:43 BoogieIcfgContainer [2022-07-22 12:53:43,351 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:53:43,353 INFO L158 Benchmark]: Toolchain (without parser) took 39936.74ms. Allocated memory was 151.0MB in the beginning and 316.7MB in the end (delta: 165.7MB). Free memory was 124.2MB in the beginning and 229.8MB in the end (delta: -105.7MB). Peak memory consumption was 188.1MB. Max. memory is 8.0GB. [2022-07-22 12:53:43,353 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:53:43,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 832.33ms. Allocated memory is still 151.0MB. Free memory was 124.0MB in the beginning and 130.6MB in the end (delta: -6.6MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. [2022-07-22 12:53:43,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.50ms. Allocated memory is still 151.0MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:53:43,355 INFO L158 Benchmark]: Boogie Preprocessor took 35.28ms. Allocated memory is still 151.0MB. Free memory was 128.5MB in the beginning and 126.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:53:43,355 INFO L158 Benchmark]: RCFGBuilder took 593.60ms. Allocated memory is still 151.0MB. Free memory was 126.9MB in the beginning and 111.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-07-22 12:53:43,356 INFO L158 Benchmark]: BuchiAutomizer took 38403.50ms. Allocated memory was 151.0MB in the beginning and 316.7MB in the end (delta: 165.7MB). Free memory was 111.2MB in the beginning and 229.8MB in the end (delta: -118.6MB). Peak memory consumption was 174.0MB. Max. memory is 8.0GB. [2022-07-22 12:53:43,359 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.29ms. Allocated memory is still 151.0MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 832.33ms. Allocated memory is still 151.0MB. Free memory was 124.0MB in the beginning and 130.6MB in the end (delta: -6.6MB). Peak memory consumption was 29.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.50ms. Allocated memory is still 151.0MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.28ms. Allocated memory is still 151.0MB. Free memory was 128.5MB in the beginning and 126.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 593.60ms. Allocated memory is still 151.0MB. Free memory was 126.9MB in the beginning and 111.2MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 38403.50ms. Allocated memory was 151.0MB in the beginning and 316.7MB in the end (delta: 165.7MB). Free memory was 111.2MB in the beginning and 229.8MB in the end (delta: -118.6MB). Peak memory consumption was 174.0MB. 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 (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 5 + i * -2 and consists of 3 locations. One deterministic module has affine ranking function 5 + i * -2 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 720 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 28.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 425 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 41 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital524 mio100 ax140 hnf100 lsp64 ukn36 mio100 lsp16 div100 bol100 ite100 ukn100 eq224 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 8.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 894]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result={0:0}, \result=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14cfaed1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16dd3972 in-52428,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@272943fc in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2935b440=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d513796=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68c773df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@487d7323=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6fd331d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@20022fa4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3730bebe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3df063c4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@72b0d07f=0, t1={7:0}, t2={6:0}, total=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 894]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) [L890] 2 int j; [L891] 2 j = 0 [L892] COND TRUE 2 j < 3 Loop: [L894] COND TRUE num == 0 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 129 PlacesBefore, 33 PlacesAfterwards, 132 TransitionsBefore, 31 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 8 ConcurrentYvCompositions, 5 ChoiceCompositions, 114 TotalNumberOfCompositions, 4371 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2422, positive: 2254, positive conditional: 0, positive unconditional: 2254, negative: 168, negative conditional: 0, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 995, positive: 964, positive conditional: 0, positive unconditional: 964, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2422, positive: 1290, positive conditional: 0, positive unconditional: 1290, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 995, unknown conditional: 0, unknown unconditional: 995] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:53:43,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...