/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-0d686a6 [2022-07-26 14:21:02,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:21:02,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:21:02,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:21:02,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:21:02,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:21:02,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:21:02,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:21:02,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:21:02,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:21:02,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:21:02,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:21:02,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:21:02,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:21:02,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:21:02,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:21:02,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:21:02,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:21:02,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:21:02,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:21:02,841 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:21:02,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:21:02,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:21:02,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:21:02,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:21:02,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:21:02,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:21:02,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:21:02,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:21:02,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:21:02,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:21:02,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:21:02,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:21:02,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:21:02,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:21:02,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:21:02,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:21:02,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:21:02,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:21:02,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:21:02,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:21:02,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:21:02,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-26 14:21:02,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:21:02,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:21:02,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:21:02,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:21:02,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:21:02,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:21:02,904 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:21:02,904 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:21:02,904 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:21:02,905 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:21:02,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:21:02,905 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:21:02,905 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:21:02,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:21:02,906 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:21:02,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:21:02,907 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:21:02,908 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:21:02,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:21:02,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:21:02,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:21:02,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:21:02,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:21:02,909 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:21:02,909 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:21:02,910 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-26 14:21:03,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:21:03,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:21:03,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:21:03,162 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:21:03,164 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:21:03,165 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-26 14:21:03,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715a3747b/f21bde75b6484f6b884139d04b778796/FLAG303e57bbe [2022-07-26 14:21:03,757 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:21:03,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-07-26 14:21:03,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715a3747b/f21bde75b6484f6b884139d04b778796/FLAG303e57bbe [2022-07-26 14:21:04,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715a3747b/f21bde75b6484f6b884139d04b778796 [2022-07-26 14:21:04,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:21:04,075 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:21:04,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:21:04,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:21:04,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:21:04,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6100ead4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04, skipping insertion in model container [2022-07-26 14:21:04,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:21:04,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:21:04,624 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-26 14:21:04,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:21:04,642 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:21:04,688 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-26 14:21:04,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:21:04,745 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:21:04,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04 WrapperNode [2022-07-26 14:21:04,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:21:04,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:21:04,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:21:04,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:21:04,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,811 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-07-26 14:21:04,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:21:04,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:21:04,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:21:04,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:21:04,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:21:04,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:21:04,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:21:04,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:21:04,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (1/1) ... [2022-07-26 14:21:04,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:04,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:04,892 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-26 14:21:04,923 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-26 14:21:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-26 14:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:21:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:21:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:21:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:21:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:21:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-26 14:21:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:21:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:21:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:21:04,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:21:04,947 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 14:21:05,078 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:21:05,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:21:05,318 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:21:05,325 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:21:05,325 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 14:21:05,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:21:05 BoogieIcfgContainer [2022-07-26 14:21:05,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:21:05,328 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:21:05,328 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:21:05,337 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:21:05,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:21:05,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:21:04" (1/3) ... [2022-07-26 14:21:05,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d4261d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:21:05, skipping insertion in model container [2022-07-26 14:21:05,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:21:05,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:21:04" (2/3) ... [2022-07-26 14:21:05,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d4261d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:21:05, skipping insertion in model container [2022-07-26 14:21:05,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:21:05,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:21:05" (3/3) ... [2022-07-26 14:21:05,340 INFO L322 chiAutomizerObserver]: Analyzing ICFG arithmetic_prog_bad.i [2022-07-26 14:21:05,435 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 14:21:05,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 136 transitions, 288 flow [2022-07-26 14:21:05,514 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-26 14:21:05,514 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:21:05,521 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-26 14:21:05,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 136 transitions, 288 flow [2022-07-26 14:21:05,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 132 transitions, 276 flow [2022-07-26 14:21:05,534 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:21:05,541 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-26 14:21:05,546 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-26 14:21:05,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 132 transitions, 276 flow [2022-07-26 14:21:05,581 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-26 14:21:05,582 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 14:21:05,583 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-26 14:21:05,585 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2022-07-26 14:21:11,614 INFO L131 LiptonReduction]: Checked pairs total: 4371 [2022-07-26 14:21:11,614 INFO L133 LiptonReduction]: Total number of compositions: 114 [2022-07-26 14:21:11,629 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:21:11,629 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:21:11,630 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:21:11,630 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:21:11,630 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:21:11,630 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:21:11,630 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:21:11,630 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:21:11,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:21:11,709 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-26 14:21:11,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:11,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:11,715 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:21:11,715 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:21:11,715 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:21:11,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 221 states, but on-demand construction may add more states [2022-07-26 14:21:11,740 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-26 14:21:11,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:11,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:11,740 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:21:11,740 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-26 14:21:11,745 INFO L733 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-26 14:21:11,745 INFO L735 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#[L913-4, 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] 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-26 14:21:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash 503789, now seen corresponding path program 1 times [2022-07-26 14:21:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:11,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109287058] [2022-07-26 14:21:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:11,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:11,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:12,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash 14772711, now seen corresponding path program 1 times [2022-07-26 14:21:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:12,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124235145] [2022-07-26 14:21:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:12,088 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-26 14:21:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:21:12,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124235145] [2022-07-26 14:21:12,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124235145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:21:12,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:21:12,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:21:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831770650] [2022-07-26 14:21:12,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:21:12,098 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 14:21:12,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:21:12,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-26 14:21:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-26 14:21:12,126 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-26 14:21:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:21:12,193 INFO L93 Difference]: Finished difference Result 222 states and 572 transitions. [2022-07-26 14:21:12,194 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 572 transitions. [2022-07-26 14:21:12,202 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-26 14:21:12,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 216 states and 561 transitions. [2022-07-26 14:21:12,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2022-07-26 14:21:12,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2022-07-26 14:21:12,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 561 transitions. [2022-07-26 14:21:12,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:21:12,221 INFO L220 hiAutomatonCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-26 14:21:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 561 transitions. [2022-07-26 14:21:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-26 14:21:12,271 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-26 14:21:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 561 transitions. [2022-07-26 14:21:12,278 INFO L242 hiAutomatonCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-26 14:21:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-26 14:21:12,283 INFO L426 stractBuchiCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-26 14:21:12,284 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:21:12,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 561 transitions. [2022-07-26 14:21:12,287 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-26 14:21:12,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:12,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:12,295 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 14:21:12,295 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:21:12,297 INFO L733 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-26 14:21:12,298 INFO L735 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#[L913-4, 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] 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-26 14:21:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 503789, now seen corresponding path program 2 times [2022-07-26 14:21:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:12,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377714400] [2022-07-26 14:21:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:12,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:12,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1193071787, now seen corresponding path program 1 times [2022-07-26 14:21:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:12,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994554019] [2022-07-26 14:21:12,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:12,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:12,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:12,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 212067223, now seen corresponding path program 1 times [2022-07-26 14:21:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:12,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254916518] [2022-07-26 14:21:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:12,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:12,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:13,887 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:21:13,888 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:21:13,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:21:13,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:21:13,888 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:21:13,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:13,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:21:13,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:21:13,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: arithmetic_prog_bad.i_BEv2_Iteration2_Lasso [2022-07-26 14:21:13,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:21:13,889 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:21:13,910 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,914 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,916 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,919 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,921 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,926 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,928 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,931 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,933 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,935 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,938 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,940 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,942 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,945 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,947 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,949 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,951 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,953 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,958 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,963 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,965 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,967 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,969 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,972 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,974 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,977 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,980 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,982 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,985 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,986 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,989 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,992 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,994 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,997 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:13,999 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,002 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,004 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,007 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,009 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,012 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,014 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,017 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,022 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,026 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,028 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,031 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,034 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,036 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,037 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,039 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,042 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,044 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,048 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,050 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,053 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,055 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,058 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:14,060 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 14:21:17,008 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:21:17,012 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:21:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:17,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:17,019 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-26 14:21:17,020 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-26 14:21:17,023 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-26 14:21:17,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:17,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:17,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:17,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:17,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:17,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:17,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:17,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:17,069 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-26 14:21:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:17,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:17,072 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-26 14:21:17,077 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-26 14:21:17,078 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-26 14:21:17,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:17,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:17,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:17,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:17,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:17,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:17,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:17,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:17,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-26 14:21:17,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:17,116 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-26 14:21:17,117 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-26 14:21:17,119 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-26 14:21:17,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:17,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:17,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:17,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:17,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:17,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:17,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:17,186 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-26 14:21:17,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:17,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:17,188 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-26 14:21:17,194 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-26 14:21:17,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:17,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:21:17,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:17,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:17,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:17,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:21:17,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:21:17,207 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-26 14:21:17,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:21:17,233 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-26 14:21:17,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:17,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:17,234 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-26 14:21:17,242 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-26 14:21:17,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:21:17,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:21:17,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:21:17,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:21:17,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:21:17,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:21:17,258 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-26 14:21:17,267 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:21:17,296 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-26 14:21:17,296 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-26 14:21:17,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:21:17,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:21:17,300 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-26 14:21:17,301 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-26 14:21:17,302 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:21:17,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:21:17,338 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:21:17,338 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0) = -2*thread1Thread1of1ForFork1_~i~0 + 5 Supporting invariants [] [2022-07-26 14:21:17,360 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-26 14:21:17,807 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-26 14:21:20,117 INFO L156 tatePredicateManager]: 351 out of 351 supporting invariants were superfluous and have been removed [2022-07-26 14:21:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:20,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:21:20,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:20,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:21:20,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:21:20,212 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-26 14:21:20,216 INFO L141 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-26 14:21:20,217 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-26 14:21:20,347 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 503 states and 1488 transitions. Complement of second has 6 states. [2022-07-26 14:21:20,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 14:21:20,349 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-26 14:21:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-07-26 14:21:20,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-26 14:21:20,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:20,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-26 14:21:20,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:20,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 3 letters. Loop has 12 letters. [2022-07-26 14:21:20,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:21:20,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 1488 transitions. [2022-07-26 14:21:20,359 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 172 [2022-07-26 14:21:20,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 461 states and 1351 transitions. [2022-07-26 14:21:20,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2022-07-26 14:21:20,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 282 [2022-07-26 14:21:20,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 1351 transitions. [2022-07-26 14:21:20,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:20,366 INFO L220 hiAutomatonCegarLoop]: Abstraction has 461 states and 1351 transitions. [2022-07-26 14:21:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 1351 transitions. [2022-07-26 14:21:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 406. [2022-07-26 14:21:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 406 states have (on average 2.916256157635468) internal successors, (1184), 405 states have internal predecessors, (1184), 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-26 14:21:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1184 transitions. [2022-07-26 14:21:20,388 INFO L242 hiAutomatonCegarLoop]: Abstraction has 406 states and 1184 transitions. [2022-07-26 14:21:20,388 INFO L426 stractBuchiCegarLoop]: Abstraction has 406 states and 1184 transitions. [2022-07-26 14:21:20,388 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:21:20,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 406 states and 1184 transitions. [2022-07-26 14:21:20,391 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 172 [2022-07-26 14:21:20,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:20,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:20,391 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:21:20,392 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 14:21:20,392 INFO L733 eck$LassoCheckResult]: Stem: 4002#[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] 3854#[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] 3856#[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] 3344#[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] 3352#[L913-4, L880-2]don't care [2022-07-26 14:21:20,392 INFO L735 eck$LassoCheckResult]: Loop: 3352#[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[] 3498#[L913-4, L881]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] 3500#[L913-4, L881-1]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] 3352#[L913-4, L880-2]don't care [2022-07-26 14:21:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 15617909, now seen corresponding path program 1 times [2022-07-26 14:21:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:20,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078141408] [2022-07-26 14:21:20,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 350652, now seen corresponding path program 1 times [2022-07-26 14:21:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:20,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831771109] [2022-07-26 14:21:20,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:20,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1416979912, now seen corresponding path program 1 times [2022-07-26 14:21:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:20,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610693554] [2022-07-26 14:21:20,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:20,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:21:20,474 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-26 14:21:20,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:21:20,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610693554] [2022-07-26 14:21:20,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610693554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:21:20,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:21:20,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:21:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964242578] [2022-07-26 14:21:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:21:20,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:21:20,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:21:20,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:21:20,494 INFO L87 Difference]: Start difference. First operand 406 states and 1184 transitions. cyclomatic complexity: 810 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-26 14:21:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:21:20,557 INFO L93 Difference]: Finished difference Result 574 states and 1574 transitions. [2022-07-26 14:21:20,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 574 states and 1574 transitions. [2022-07-26 14:21:20,562 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 196 [2022-07-26 14:21:20,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 574 states to 570 states and 1561 transitions. [2022-07-26 14:21:20,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2022-07-26 14:21:20,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2022-07-26 14:21:20,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 1561 transitions. [2022-07-26 14:21:20,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:21:20,567 INFO L220 hiAutomatonCegarLoop]: Abstraction has 570 states and 1561 transitions. [2022-07-26 14:21:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 1561 transitions. [2022-07-26 14:21:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 566. [2022-07-26 14:21:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 566 states have (on average 2.7473498233215548) internal successors, (1555), 565 states have internal predecessors, (1555), 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-26 14:21:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1555 transitions. [2022-07-26 14:21:20,581 INFO L242 hiAutomatonCegarLoop]: Abstraction has 566 states and 1555 transitions. [2022-07-26 14:21:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:21:20,582 INFO L426 stractBuchiCegarLoop]: Abstraction has 566 states and 1555 transitions. [2022-07-26 14:21:20,583 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:21:20,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 1555 transitions. [2022-07-26 14:21:20,585 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 196 [2022-07-26 14:21:20,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:21:20,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:21:20,586 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 14:21:20,586 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 14:21:20,587 INFO L733 eck$LassoCheckResult]: Stem: 5482#[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] 5250#[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] 5252#[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] 5362#[thread1ENTRY, L914-3]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] 5388#[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] 5390#[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] 5254#[thread1ENTRY, L894-2, L914-4]don't care [2022-07-26 14:21:20,587 INFO L735 eck$LassoCheckResult]: Loop: 5254#[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[] 4640#[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] 4646#[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] 5254#[thread1ENTRY, L894-2, L914-4]don't care [2022-07-26 14:21:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:20,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2124553538, now seen corresponding path program 1 times [2022-07-26 14:21:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:20,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883292521] [2022-07-26 14:21:20,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:20,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 374509, now seen corresponding path program 1 times [2022-07-26 14:21:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:20,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436359908] [2022-07-26 14:21:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:21:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1936721420, now seen corresponding path program 1 times [2022-07-26 14:21:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:21:20,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376222221] [2022-07-26 14:21:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:21:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:21:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:21:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:21:20,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:21:22,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:21:22 BoogieIcfgContainer [2022-07-26 14:21:22,631 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:21:22,636 INFO L158 Benchmark]: Toolchain (without parser) took 18556.96ms. Allocated memory was 182.5MB in the beginning and 316.7MB in the end (delta: 134.2MB). Free memory was 128.7MB in the beginning and 140.5MB in the end (delta: -11.8MB). Peak memory consumption was 166.0MB. Max. memory is 8.0GB. [2022-07-26 14:21:22,637 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:21:22,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.99ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 128.5MB in the beginning and 176.8MB in the end (delta: -48.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-07-26 14:21:22,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.63ms. Allocated memory is still 219.2MB. Free memory was 176.8MB in the beginning and 174.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:21:22,638 INFO L158 Benchmark]: Boogie Preprocessor took 47.68ms. Allocated memory is still 219.2MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 14:21:22,638 INFO L158 Benchmark]: RCFGBuilder took 466.62ms. Allocated memory is still 219.2MB. Free memory was 173.2MB in the beginning and 158.0MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-07-26 14:21:22,644 INFO L158 Benchmark]: BuchiAutomizer took 17303.62ms. Allocated memory was 219.2MB in the beginning and 316.7MB in the end (delta: 97.5MB). Free memory was 157.4MB in the beginning and 140.5MB in the end (delta: 17.0MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. [2022-07-26 14:21:22,645 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.12ms. Allocated memory is still 182.5MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 668.99ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 128.5MB in the beginning and 176.8MB in the end (delta: -48.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.63ms. Allocated memory is still 219.2MB. Free memory was 176.8MB in the beginning and 174.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.68ms. Allocated memory is still 219.2MB. Free memory was 174.7MB in the beginning and 173.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 466.62ms. Allocated memory is still 219.2MB. Free memory was 173.2MB in the beginning and 158.0MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 17303.62ms. Allocated memory was 219.2MB in the beginning and 316.7MB in the end (delta: 97.5MB). Free memory was 157.4MB in the beginning and 140.5MB in the end (delta: 17.0MB). Peak memory consumption was 158.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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 5 + i * -2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 566 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 10.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 59 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 28 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital499 mio100 ax142 hnf100 lsp62 ukn36 mio100 lsp15 div100 bol100 ite100 ukn100 eq223 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms 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: 6.1s - 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:0}, \result=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@1d7f783e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@251b6528=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4fb0b270=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51212df7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@578862a2 in-1342,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c923693 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5ec1a20e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@721ae5bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@26ee1dcd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@340fa290=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@381123e2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@49426cdc=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: 6.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-26 14:21:22,701 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...