/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/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 14:18:53,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 14:18:53,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 14:18:53,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 14:18:53,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 14:18:53,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 14:18:53,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 14:18:53,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 14:18:53,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 14:18:53,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 14:18:53,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 14:18:53,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 14:18:53,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 14:18:53,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 14:18:53,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 14:18:53,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 14:18:53,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 14:18:53,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 14:18:53,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 14:18:53,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 14:18:53,751 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 14:18:53,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 14:18:53,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 14:18:53,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 14:18:53,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 14:18:53,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 14:18:53,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 14:18:53,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 14:18:53,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 14:18:53,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 14:18:53,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 14:18:53,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 14:18:53,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 14:18:53,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 14:18:53,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 14:18:53,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 14:18:53,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 14:18:53,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 14:18:53,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 14:18:53,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 14:18:53,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 14:18:53,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 14:18:53,766 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:18:53,787 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 14:18:53,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 14:18:53,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 14:18:53,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 14:18:53,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 14:18:53,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 14:18:53,789 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 14:18:53,789 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 14:18:53,790 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 14:18:53,790 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 14:18:53,790 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 14:18:53,790 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 14:18:53,790 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 14:18:53,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 14:18:53,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 14:18:53,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 14:18:53,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 14:18:53,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 14:18:53,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 14:18:53,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 14:18:53,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 14:18:53,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 14:18:53,792 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 14:18:53,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 14:18:53,792 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 14:18:53,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 14:18:53,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 14:18:53,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 14:18:53,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 14:18:53,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 14:18:53,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 14:18:53,793 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-26 14:18:53,794 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 14:18:53,794 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:18:54,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 14:18:54,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 14:18:54,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 14:18:54,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 14:18:54,020 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 14:18:54,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-07-26 14:18:54,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d9c2b15/dc21e4ab4f63473f896436c2a42c717f/FLAG051ca4b69 [2022-07-26 14:18:54,439 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 14:18:54,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-07-26 14:18:54,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d9c2b15/dc21e4ab4f63473f896436c2a42c717f/FLAG051ca4b69 [2022-07-26 14:18:54,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58d9c2b15/dc21e4ab4f63473f896436c2a42c717f [2022-07-26 14:18:54,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 14:18:54,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 14:18:54,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 14:18:54,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 14:18:54,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 14:18:54,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5226c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54, skipping insertion in model container [2022-07-26 14:18:54,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 14:18:54,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 14:18:54,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-07-26 14:18:54,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:18:54,739 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 14:18:54,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-07-26 14:18:54,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 14:18:54,787 INFO L208 MainTranslator]: Completed translation [2022-07-26 14:18:54,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54 WrapperNode [2022-07-26 14:18:54,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 14:18:54,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 14:18:54,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 14:18:54,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 14:18:54,795 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:18:54" (1/1) ... [2022-07-26 14:18:54,810 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:18:54" (1/1) ... [2022-07-26 14:18:54,835 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 162 [2022-07-26 14:18:54,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 14:18:54,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 14:18:54,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 14:18:54,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 14:18:54,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 14:18:54,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 14:18:54,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 14:18:54,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 14:18:54,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (1/1) ... [2022-07-26 14:18:54,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:18:54,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:18:54,900 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:18:54,903 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:18:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 14:18:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 14:18:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 14:18:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 14:18:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 14:18:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 14:18:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-26 14:18:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 14:18:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 14:18:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 14:18:54,930 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:18:55,008 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 14:18:55,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 14:18:55,284 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 14:18:55,351 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 14:18:55,352 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 14:18:55,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:18:55 BoogieIcfgContainer [2022-07-26 14:18:55,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 14:18:55,354 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 14:18:55,354 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 14:18:55,357 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 14:18:55,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:18:55,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 02:18:54" (1/3) ... [2022-07-26 14:18:55,358 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7af26739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:18:55, skipping insertion in model container [2022-07-26 14:18:55,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:18:55,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 02:18:54" (2/3) ... [2022-07-26 14:18:55,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7af26739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 02:18:55, skipping insertion in model container [2022-07-26 14:18:55,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 14:18:55,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 02:18:55" (3/3) ... [2022-07-26 14:18:55,359 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-07-26 14:18:55,439 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-26 14:18:55,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 332 flow [2022-07-26 14:18:55,511 INFO L129 PetriNetUnfolder]: 11/148 cut-off events. [2022-07-26 14:18:55,511 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 14:18:55,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 11/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-07-26 14:18:55,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 154 transitions, 332 flow [2022-07-26 14:18:55,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 148 transitions, 314 flow [2022-07-26 14:18:55,525 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-26 14:18:55,531 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 148 transitions, 314 flow [2022-07-26 14:18:55,532 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 148 transitions, 314 flow [2022-07-26 14:18:55,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 148 transitions, 314 flow [2022-07-26 14:18:55,553 INFO L129 PetriNetUnfolder]: 11/148 cut-off events. [2022-07-26 14:18:55,554 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 14:18:55,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 11/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-07-26 14:18:55,556 INFO L116 LiptonReduction]: Number of co-enabled transitions 1082 [2022-07-26 14:18:59,633 INFO L131 LiptonReduction]: Checked pairs total: 1971 [2022-07-26 14:18:59,633 INFO L133 LiptonReduction]: Total number of compositions: 145 [2022-07-26 14:18:59,645 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 14:18:59,646 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 14:18:59,647 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 14:18:59,647 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 14:18:59,647 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 14:18:59,647 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 14:18:59,647 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 14:18:59,647 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 14:18:59,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 14:18:59,709 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 113 [2022-07-26 14:18:59,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:59,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:59,713 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:18:59,713 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:59,713 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 14:18:59,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 156 states, but on-demand construction may add more states [2022-07-26 14:18:59,721 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 113 [2022-07-26 14:18:59,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:18:59,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:18:59,721 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 14:18:59,721 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 14:18:59,724 INFO L733 eck$LassoCheckResult]: Stem: 153#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, 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_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 156#[L126-6]don't care [2022-07-26 14:18:59,724 INFO L735 eck$LassoCheckResult]: Loop: 156#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 156#[L126-6]don't care [2022-07-26 14:18:59,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 636, now seen corresponding path program 1 times [2022-07-26 14:18:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:59,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302852870] [2022-07-26 14:18:59,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:59,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:59,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2022-07-26 14:18:59,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:59,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272049677] [2022-07-26 14:18:59,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:59,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:59,906 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:59,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:18:59,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:18:59,919 INFO L85 PathProgramCache]: Analyzing trace with hash 20290, now seen corresponding path program 1 times [2022-07-26 14:18:59,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:18:59,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664762820] [2022-07-26 14:18:59,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:18:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:18:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:59,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:18:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:18:59,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:00,627 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:00,628 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:00,628 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:00,628 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:00,628 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:00,628 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:00,628 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:00,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:00,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 14:19:00,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:00,629 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:00,641 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:19:00,645 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:19:00,647 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:19:00,648 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:19:00,650 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:19:00,652 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:19:00,654 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:19:00,657 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:19:00,659 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:19:00,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:19:00,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:19:00,946 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:19:00,948 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:19:00,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:19:00,952 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:19:00,954 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:19:00,955 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:19:00,957 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:19:00,959 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:19:00,960 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:19:00,962 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:19:00,964 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:19:00,966 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:19:00,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:19:00,971 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:19:00,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:19:00,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:19:00,975 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:19:00,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:19:00,979 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:19:00,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:19:00,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:19:00,984 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:19:00,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:19:00,987 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:19:00,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:19:00,990 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:19:00,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:19:00,993 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:19:01,314 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:01,317 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:01,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,319 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:19:01,322 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:19:01,323 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:19:01,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:01,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:01,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:01,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-26 14:19:01,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,363 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:19:01,379 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:19:01,379 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:19:01,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,411 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,430 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:19:01,433 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:19:01,434 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:19:01,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:01,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:01,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:01,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,466 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:19:01,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,467 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:19:01,468 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:19:01,470 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:19:01,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:01,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:01,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:01,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,496 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:19:01,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,497 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:19:01,498 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:19:01,507 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:19:01,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:01,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:01,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:01,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,549 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:19:01,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,550 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:19:01,552 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:19:01,553 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:19:01,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-26 14:19:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,593 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-26 14:19:01,596 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:19:01,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:01,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:01,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:01,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,649 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-26 14:19:01,651 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:19:01,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:01,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:01,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:01,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,686 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-26 14:19:01,688 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:19:01,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-26 14:19:01,735 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:19:01,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-26 14:19:01,782 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:19:01,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-26 14:19:01,811 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:19:01,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,857 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-26 14:19:01,859 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:19:01,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:01,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:01,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,893 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-26 14:19:01,894 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:19:01,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:01,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:01,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:01,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:01,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:01,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:01,918 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:01,947 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 14:19:01,947 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-26 14:19:01,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:01,949 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:01,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-26 14:19:01,951 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:01,981 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:19:01,981 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:01,982 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 2*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 2*ULTIMATE.start_create_fresh_int_array_~size#1 >= 0] [2022-07-26 14:19:02,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:02,053 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-07-26 14:19:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:02,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:19:02,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:02,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:19:02,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:02,124 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:19:02,142 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:02,143 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 156 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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:19:02,238 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 156 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 312 states and 876 transitions. Complement of second has 5 states. [2022-07-26 14:19:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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:19:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-07-26 14:19:02,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 14:19:02,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:02,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 14:19:02,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:02,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 14:19:02,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:02,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 876 transitions. [2022-07-26 14:19:02,257 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-26 14:19:02,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 142 states and 404 transitions. [2022-07-26 14:19:02,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-07-26 14:19:02,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-26 14:19:02,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 404 transitions. [2022-07-26 14:19:02,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:02,271 INFO L220 hiAutomatonCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-26 14:19:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 404 transitions. [2022-07-26 14:19:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-26 14:19:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.8450704225352115) internal successors, (404), 141 states have internal predecessors, (404), 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:19:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 404 transitions. [2022-07-26 14:19:02,307 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-26 14:19:02,307 INFO L426 stractBuchiCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-26 14:19:02,307 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 14:19:02,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 404 transitions. [2022-07-26 14:19:02,309 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-26 14:19:02,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:02,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:02,309 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 14:19:02,310 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:02,310 INFO L733 eck$LassoCheckResult]: Stem: 1176#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, 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_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1102#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 904#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 906#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 1128#[L108-4, L48-4]don't care [2022-07-26 14:19:02,312 INFO L735 eck$LassoCheckResult]: Loop: 1128#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1126#[L108-4, L55]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 1128#[L108-4, L48-4]don't care [2022-07-26 14:19:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash 19540963, now seen corresponding path program 1 times [2022-07-26 14:19:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:02,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964371700] [2022-07-26 14:19:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,359 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:02,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:02,374 INFO L85 PathProgramCache]: Analyzing trace with hash 18619, now seen corresponding path program 1 times [2022-07-26 14:19:02,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:02,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147307719] [2022-07-26 14:19:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:02,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,379 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1599013917, now seen corresponding path program 1 times [2022-07-26 14:19:02,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:02,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987780107] [2022-07-26 14:19:02,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:02,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:02,458 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:19:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:02,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987780107] [2022-07-26 14:19:02,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987780107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:02,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:02,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:19:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872545756] [2022-07-26 14:19:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:02,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:02,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 14:19:02,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 14:19:02,566 INFO L87 Difference]: Start difference. First operand 142 states and 404 transitions. cyclomatic complexity: 299 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:02,630 INFO L93 Difference]: Finished difference Result 225 states and 591 transitions. [2022-07-26 14:19:02,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 591 transitions. [2022-07-26 14:19:02,632 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-26 14:19:02,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 142 states and 403 transitions. [2022-07-26 14:19:02,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-07-26 14:19:02,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-26 14:19:02,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 403 transitions. [2022-07-26 14:19:02,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:02,639 INFO L220 hiAutomatonCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-26 14:19:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 403 transitions. [2022-07-26 14:19:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-26 14:19:02,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.8380281690140845) internal successors, (403), 141 states have internal predecessors, (403), 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:19:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 403 transitions. [2022-07-26 14:19:02,656 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-26 14:19:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 14:19:02,657 INFO L426 stractBuchiCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-26 14:19:02,657 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 14:19:02,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 403 transitions. [2022-07-26 14:19:02,658 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-26 14:19:02,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:02,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:02,658 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 14:19:02,658 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 14:19:02,660 INFO L733 eck$LassoCheckResult]: Stem: 1696#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, 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_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1622#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 1624#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1424#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 1426#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 1648#[L108-4, L48-4]don't care [2022-07-26 14:19:02,660 INFO L735 eck$LassoCheckResult]: Loop: 1648#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1646#[L108-4, L55]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 1648#[L108-4, L48-4]don't care [2022-07-26 14:19:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash 605053277, now seen corresponding path program 1 times [2022-07-26 14:19:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:02,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931135268] [2022-07-26 14:19:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 18619, now seen corresponding path program 2 times [2022-07-26 14:19:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:02,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367251822] [2022-07-26 14:19:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1635631895, now seen corresponding path program 1 times [2022-07-26 14:19:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:02,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158923652] [2022-07-26 14:19:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:02,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:04,065 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:04,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:04,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:04,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:04,066 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:04,066 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:04,066 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:04,066 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:04,066 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration3_Lasso [2022-07-26 14:19:04,066 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:04,066 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:04,071 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:19:04,080 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:19:04,082 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:19:04,628 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:19:04,630 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:19:04,631 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:19:04,633 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:19:04,634 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:19:04,636 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:19:04,637 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:19:04,640 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:19:04,644 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:19:04,646 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:19:04,648 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:19:04,650 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:19:04,652 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:19:04,654 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:19:04,656 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:19:04,658 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:19:04,659 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:19:04,661 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:19:04,662 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:19:04,664 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:19:04,665 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:19:04,667 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:19:04,670 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:19:04,671 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:19:04,673 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:19:04,674 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:19:04,676 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:19:04,680 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:19:04,681 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:19:04,683 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:19:04,684 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:19:04,686 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:19:04,687 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:19:04,689 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:19:04,695 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:19:04,696 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:19:04,697 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:19:05,198 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:05,198 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:05,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:05,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:05,199 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 14:19:05,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-26 14:19:05,203 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:19:05,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:05,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:05,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:05,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:05,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:05,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:05,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:05,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:05,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:05,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:05,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:05,232 INFO L229 MonitoredProcess]: Starting monitored process 18 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:19:05,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-26 14:19:05,235 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:19:05,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:05,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:05,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:05,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:05,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:05,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:05,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:05,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:05,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:05,306 INFO L229 MonitoredProcess]: Starting monitored process 19 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:19:05,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-26 14:19:05,308 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:19:05,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:05,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:05,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:05,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:05,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:05,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:05,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:05,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:05,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-26 14:19:05,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:05,335 INFO L229 MonitoredProcess]: Starting monitored process 20 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:19:05,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-26 14:19:05,337 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:19:05,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:05,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:05,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:05,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:05,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:05,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:05,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:05,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:05,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:05,366 INFO L229 MonitoredProcess]: Starting monitored process 21 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:19:05,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-26 14:19:05,368 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:19:05,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:05,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:05,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:05,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:05,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:05,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:05,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:05,406 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-26 14:19:05,406 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-26 14:19:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:05,407 INFO L229 MonitoredProcess]: Starting monitored process 22 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:19:05,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-26 14:19:05,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:05,421 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:05,421 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:05,421 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, ~n~0) = -1*~back~0 + 1*~n~0 Supporting invariants [] [2022-07-26 14:19:05,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:05,513 INFO L156 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2022-07-26 14:19:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:05,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:05,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:05,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 14:19:05,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:05,557 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:19:05,558 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-26 14:19:05,558 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 403 transitions. cyclomatic complexity: 298 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:05,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 403 transitions. cyclomatic complexity: 298. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 396 states and 1381 transitions. Complement of second has 4 states. [2022-07-26 14:19:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-07-26 14:19:05,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-26 14:19:05,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:05,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-26 14:19:05,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:05,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-26 14:19:05,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:05,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 396 states and 1381 transitions. [2022-07-26 14:19:05,606 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 84 [2022-07-26 14:19:05,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 396 states to 300 states and 1028 transitions. [2022-07-26 14:19:05,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-07-26 14:19:05,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-26 14:19:05,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 300 states and 1028 transitions. [2022-07-26 14:19:05,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:05,610 INFO L220 hiAutomatonCegarLoop]: Abstraction has 300 states and 1028 transitions. [2022-07-26 14:19:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states and 1028 transitions. [2022-07-26 14:19:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 226. [2022-07-26 14:19:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 3.6548672566371683) internal successors, (826), 225 states have internal predecessors, (826), 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:19:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 826 transitions. [2022-07-26 14:19:05,615 INFO L242 hiAutomatonCegarLoop]: Abstraction has 226 states and 826 transitions. [2022-07-26 14:19:05,615 INFO L426 stractBuchiCegarLoop]: Abstraction has 226 states and 826 transitions. [2022-07-26 14:19:05,615 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 14:19:05,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 826 transitions. [2022-07-26 14:19:05,617 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 84 [2022-07-26 14:19:05,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:05,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:05,617 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:05,617 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 14:19:05,618 INFO L733 eck$LassoCheckResult]: Stem: 2699#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, 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_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2547#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 2549#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2275#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 2277#[L108-4, thread1ENTRY]don't care [575] L108-4-->L109-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_110| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (store |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_90|) (= (select |v_#valid_143| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_37|)) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_91|, #length=|v_#length_110|, 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|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_13|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_90|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 2429#[thread1ENTRY, L109-3]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2431#[thread1ENTRY, L109-4, thread2ENTRY]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_12) InVars {~v_assert~0=v_~v_assert~0_12} OutVars{~v_assert~0=v_~v_assert~0_12, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 2469#[thread1ENTRY, L109-4, L81]don't care [2022-07-26 14:19:05,618 INFO L735 eck$LassoCheckResult]: Loop: 2469#[thread1ENTRY, L109-4, L81]don't care [522] L81-->L75: Formula: (let ((.cse0 (* v_~front~0_41 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_29))) (and (<= (+ .cse0 4 v_~queue~0.offset_29) (select |v_#length_74| v_~queue~0.base_29)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_34)) 1 0)) (= (select |v_#valid_95| v_~queue~0.base_29) 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0)) (= v_~front~0_40 (+ v_~front~0_41 1)) (= (select (select |v_#memory_int_62| v_~queue~0.base_29) .cse1) |v_thread2Thread1of1ForFork1_~temp~0#1_11|) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_95|, ~back~0=v_~back~0_50, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_34, ~front~0=v_~front~0_41} OutVars{~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_11|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~n~0=v_~n~0_34, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 2663#[L75, thread1ENTRY, L109-4]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 2643#[L78, thread1ENTRY, L109-4]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 2469#[thread1ENTRY, L109-4, L81]don't care [2022-07-26 14:19:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1635774901, now seen corresponding path program 1 times [2022-07-26 14:19:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:05,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610484276] [2022-07-26 14:19:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 1 times [2022-07-26 14:19:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:05,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664638859] [2022-07-26 14:19:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 671651126, now seen corresponding path program 1 times [2022-07-26 14:19:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:05,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154390576] [2022-07-26 14:19:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-26 14:19:05,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 14:19:05,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154390576] [2022-07-26 14:19:05,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154390576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 14:19:05,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 14:19:05,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 14:19:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713233257] [2022-07-26 14:19:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 14:19:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 14:19:05,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 14:19:05,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 14:19:05,802 INFO L87 Difference]: Start difference. First operand 226 states and 826 transitions. cyclomatic complexity: 643 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 14:19:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 14:19:05,840 INFO L93 Difference]: Finished difference Result 278 states and 855 transitions. [2022-07-26 14:19:05,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 855 transitions. [2022-07-26 14:19:05,842 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-26 14:19:05,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 229 states and 706 transitions. [2022-07-26 14:19:05,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-26 14:19:05,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-26 14:19:05,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 706 transitions. [2022-07-26 14:19:05,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:05,845 INFO L220 hiAutomatonCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-26 14:19:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 706 transitions. [2022-07-26 14:19:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-07-26 14:19:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 3.0829694323144103) internal successors, (706), 228 states have internal predecessors, (706), 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:19:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 706 transitions. [2022-07-26 14:19:05,876 INFO L242 hiAutomatonCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-26 14:19:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 14:19:05,877 INFO L426 stractBuchiCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-26 14:19:05,877 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 14:19:05,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 706 transitions. [2022-07-26 14:19:05,878 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-26 14:19:05,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:05,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:05,879 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:05,879 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 14:19:05,880 INFO L733 eck$LassoCheckResult]: Stem: 3407#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, 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_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3241#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 3243#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3011#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 3013#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 3373#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 3277#[L108-4, L55]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 3279#[L108-4, L48-4]don't care [575] L108-4-->L109-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_110| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (store |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_90|) (= (select |v_#valid_143| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_37|)) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_91|, #length=|v_#length_110|, 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|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_13|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_90|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 3387#[L48-4, L109-3]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3445#[thread2ENTRY, L109-4, L48-4]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_12) InVars {~v_assert~0=v_~v_assert~0_12} OutVars{~v_assert~0=v_~v_assert~0_12, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 3367#[L109-4, L81, L48-4]don't care [2022-07-26 14:19:05,880 INFO L735 eck$LassoCheckResult]: Loop: 3367#[L109-4, L81, L48-4]don't care [522] L81-->L75: Formula: (let ((.cse0 (* v_~front~0_41 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_29))) (and (<= (+ .cse0 4 v_~queue~0.offset_29) (select |v_#length_74| v_~queue~0.base_29)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_34)) 1 0)) (= (select |v_#valid_95| v_~queue~0.base_29) 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0)) (= v_~front~0_40 (+ v_~front~0_41 1)) (= (select (select |v_#memory_int_62| v_~queue~0.base_29) .cse1) |v_thread2Thread1of1ForFork1_~temp~0#1_11|) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_95|, ~back~0=v_~back~0_50, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_34, ~front~0=v_~front~0_41} OutVars{~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_11|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~n~0=v_~n~0_34, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 3213#[L75, L109-4, L48-4]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 3219#[L78, L109-4, L48-4]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 3367#[L109-4, L81, L48-4]don't care [2022-07-26 14:19:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 706377992, now seen corresponding path program 1 times [2022-07-26 14:19:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:05,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803481692] [2022-07-26 14:19:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:05,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:05,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 2 times [2022-07-26 14:19:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:05,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644298352] [2022-07-26 14:19:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:05,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1632474877, now seen corresponding path program 1 times [2022-07-26 14:19:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:05,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168214111] [2022-07-26 14:19:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:05,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:06,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:07,611 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:07,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:07,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:07,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:07,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:07,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:07,611 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:07,611 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:07,611 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration5_Lasso [2022-07-26 14:19:07,611 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:07,611 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:07,614 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:19:07,616 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:19:07,618 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:19:07,620 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:19:07,622 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:19:07,623 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:19:07,625 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:19:07,632 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:19:07,634 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:19:07,636 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:19:07,640 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:19:07,641 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:19:07,643 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:19:07,644 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:19:07,645 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:19:07,647 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:19:07,648 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:19:07,649 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:19:07,650 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:19:07,652 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:19:07,654 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:19:07,655 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:19:08,491 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:19:08,492 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:19:08,494 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:19:08,495 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:19:08,498 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:19:08,504 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:19:08,508 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:19:08,510 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:19:08,512 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:19:08,514 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:19:08,516 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:19:08,518 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:19:08,520 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:19:08,522 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:19:08,523 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:19:08,525 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:19:08,527 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:19:08,528 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:19:08,530 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:19:08,532 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:19:08,534 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:19:08,536 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:19:08,537 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:19:09,117 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:09,117 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:09,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,119 INFO L229 MonitoredProcess]: Starting monitored process 23 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:19:09,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-26 14:19:09,121 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:19:09,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-26 14:19:09,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,145 INFO L229 MonitoredProcess]: Starting monitored process 24 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:19:09,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-26 14:19:09,149 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:19:09,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-26 14:19:09,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,173 INFO L229 MonitoredProcess]: Starting monitored process 25 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:19:09,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-26 14:19:09,174 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:19:09,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-26 14:19:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,204 INFO L229 MonitoredProcess]: Starting monitored process 26 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:19:09,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-26 14:19:09,205 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:19:09,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-26 14:19:09,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,234 INFO L229 MonitoredProcess]: Starting monitored process 27 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:19:09,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-26 14:19:09,235 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:19:09,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-26 14:19:09,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,258 INFO L229 MonitoredProcess]: Starting monitored process 28 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:19:09,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-26 14:19:09,260 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:19:09,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-26 14:19:09,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,292 INFO L229 MonitoredProcess]: Starting monitored process 29 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:19:09,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-26 14:19:09,294 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:19:09,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:09,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,336 INFO L229 MonitoredProcess]: Starting monitored process 30 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:19:09,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-26 14:19:09,339 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:19:09,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,346 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-26 14:19:09,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,362 INFO L229 MonitoredProcess]: Starting monitored process 31 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:19:09,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-26 14:19:09,364 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:19:09,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-26 14:19:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,390 INFO L229 MonitoredProcess]: Starting monitored process 32 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:19:09,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-26 14:19:09,392 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:19:09,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,401 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-26 14:19:09,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,418 INFO L229 MonitoredProcess]: Starting monitored process 33 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:19:09,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-26 14:19:09,419 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:19:09,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:09,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,442 INFO L229 MonitoredProcess]: Starting monitored process 34 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:19:09,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-26 14:19:09,444 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:19:09,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-26 14:19:09,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,476 INFO L229 MonitoredProcess]: Starting monitored process 35 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:19:09,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-26 14:19:09,478 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:19:09,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:09,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,504 INFO L229 MonitoredProcess]: Starting monitored process 36 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:19:09,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-26 14:19:09,505 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:19:09,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-26 14:19:09,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,529 INFO L229 MonitoredProcess]: Starting monitored process 37 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:19:09,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-26 14:19:09,532 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:19:09,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-26 14:19:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,558 INFO L229 MonitoredProcess]: Starting monitored process 38 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:19:09,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-26 14:19:09,559 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:19:09,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,567 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,567 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-26 14:19:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,585 INFO L229 MonitoredProcess]: Starting monitored process 39 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:19:09,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-26 14:19:09,587 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:19:09,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:09,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,613 INFO L229 MonitoredProcess]: Starting monitored process 40 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:19:09,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-26 14:19:09,614 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:19:09,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-26 14:19:09,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,643 INFO L229 MonitoredProcess]: Starting monitored process 41 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:19:09,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-26 14:19:09,644 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:19:09,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:09,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,670 INFO L229 MonitoredProcess]: Starting monitored process 42 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:19:09,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-26 14:19:09,672 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:19:09,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-26 14:19:09,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,697 INFO L229 MonitoredProcess]: Starting monitored process 43 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:19:09,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-26 14:19:09,699 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:19:09,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:09,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:09,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:09,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-26 14:19:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,722 INFO L229 MonitoredProcess]: Starting monitored process 44 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:19:09,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-26 14:19:09,724 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:19:09,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-26 14:19:09,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,748 INFO L229 MonitoredProcess]: Starting monitored process 45 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:19:09,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-26 14:19:09,750 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:19:09,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-26 14:19:09,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,776 INFO L229 MonitoredProcess]: Starting monitored process 46 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:19:09,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-26 14:19:09,778 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:19:09,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:09,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,804 INFO L229 MonitoredProcess]: Starting monitored process 47 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:19:09,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-26 14:19:09,813 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:19:09,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:09,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:09,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:09,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:09,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:09,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:09,855 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:09,899 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2022-07-26 14:19:09,899 INFO L444 ModelExtractionUtils]: 5 out of 43 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-07-26 14:19:09,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:09,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:09,900 INFO L229 MonitoredProcess]: Starting monitored process 48 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:19:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-26 14:19:09,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:09,908 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:19:09,908 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:09,908 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~queue~0.base)_2, ~front~0) = 1*v_rep(select #length ~queue~0.base)_2 - 2*~front~0 Supporting invariants [-4*~back~0 + 1*v_rep(select #length ~queue~0.base)_2 >= 0] [2022-07-26 14:19:09,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-26 14:19:10,061 INFO L156 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2022-07-26 14:19:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:10,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-26 14:19:10,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:10,179 WARN L261 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-26 14:19:10,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:10,224 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:19:10,224 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2022-07-26 14:19:10,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 229 states and 706 transitions. cyclomatic complexity: 514 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:19:10,351 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 229 states and 706 transitions. cyclomatic complexity: 514. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 582 states and 1717 transitions. Complement of second has 8 states. [2022-07-26 14:19:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 1 non-accepting loop states 2 accepting loop states [2022-07-26 14:19:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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:19:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-07-26 14:19:10,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 3 letters. [2022-07-26 14:19:10,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:10,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2022-07-26 14:19:10,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:10,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-26 14:19:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:10,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 582 states and 1717 transitions. [2022-07-26 14:19:10,356 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-26 14:19:10,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 582 states to 321 states and 961 transitions. [2022-07-26 14:19:10,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2022-07-26 14:19:10,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2022-07-26 14:19:10,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 321 states and 961 transitions. [2022-07-26 14:19:10,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:10,359 INFO L220 hiAutomatonCegarLoop]: Abstraction has 321 states and 961 transitions. [2022-07-26 14:19:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states and 961 transitions. [2022-07-26 14:19:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 281. [2022-07-26 14:19:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 281 states have (on average 3.113879003558719) internal successors, (875), 280 states have internal predecessors, (875), 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:19:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 875 transitions. [2022-07-26 14:19:10,364 INFO L242 hiAutomatonCegarLoop]: Abstraction has 281 states and 875 transitions. [2022-07-26 14:19:10,364 INFO L426 stractBuchiCegarLoop]: Abstraction has 281 states and 875 transitions. [2022-07-26 14:19:10,364 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 14:19:10,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 875 transitions. [2022-07-26 14:19:10,365 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-26 14:19:10,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:10,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:10,366 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:10,366 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 14:19:10,366 INFO L733 eck$LassoCheckResult]: Stem: 4689#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, 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_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4513#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 4515#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4295#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 4297#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 4651#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 4545#[L108-4, L55]don't care [575] L108-4-->L109-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_110| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (store |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_90|) (= (select |v_#valid_143| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_37|)) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_91|, #length=|v_#length_110|, 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|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_13|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_90|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 4383#[L55, L109-3]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4543#[L55, L109-4, thread2ENTRY]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_12) InVars {~v_assert~0=v_~v_assert~0_12} OutVars{~v_assert~0=v_~v_assert~0_12, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 4625#[L55, L109-4, L81]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 4729#[L109-4, L81, L48-4]don't care [579] L109-4-->L110-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre14#1_19| |v_#pthreadsForks_41|) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_29| 4) (select |v_#length_116| |v_ULTIMATE.start_main_~#t3~0#1.base_33|)) (= (select |v_#valid_149| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) 1) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_29|) (= (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t3~0#1.base_33| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) |v_ULTIMATE.start_main_~#t3~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre14#1_19|)) |v_#memory_int_94|) (= (+ |v_#pthreadsForks_41| 1) |v_#pthreadsForks_40|)) InVars {#pthreadsForks=|v_#pthreadsForks_41|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_95|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|, #length=|v_#length_116|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_19|, #pthreadsForks=|v_#pthreadsForks_40|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_29|, #valid=|v_#valid_149|, #memory_int=|v_#memory_int_94|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|, #length=|v_#length_116|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 4637#[L110-3, L81, L48-4]don't care [2022-07-26 14:19:10,366 INFO L735 eck$LassoCheckResult]: Loop: 4637#[L110-3, L81, L48-4]don't care [522] L81-->L75: Formula: (let ((.cse0 (* v_~front~0_41 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_29))) (and (<= (+ .cse0 4 v_~queue~0.offset_29) (select |v_#length_74| v_~queue~0.base_29)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_34)) 1 0)) (= (select |v_#valid_95| v_~queue~0.base_29) 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0)) (= v_~front~0_40 (+ v_~front~0_41 1)) (= (select (select |v_#memory_int_62| v_~queue~0.base_29) .cse1) |v_thread2Thread1of1ForFork1_~temp~0#1_11|) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_95|, ~back~0=v_~back~0_50, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_34, ~front~0=v_~front~0_41} OutVars{~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_11|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~n~0=v_~n~0_34, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 4487#[L75, L110-3, L48-4]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 4605#[L78, L110-3, L48-4]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 4637#[L110-3, L81, L48-4]don't care [2022-07-26 14:19:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash 446121621, now seen corresponding path program 1 times [2022-07-26 14:19:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:10,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454067879] [2022-07-26 14:19:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:10,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:10,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 3 times [2022-07-26 14:19:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:10,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510446215] [2022-07-26 14:19:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:10,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:10,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1780913238, now seen corresponding path program 1 times [2022-07-26 14:19:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:10,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454580026] [2022-07-26 14:19:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:10,459 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:10,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:10,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:12,669 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:12,669 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:12,669 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:12,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:12,669 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:12,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:12,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:12,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:12,669 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration6_Lasso [2022-07-26 14:19:12,669 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:12,669 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:12,672 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:19:12,673 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:19:13,400 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:19:13,402 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:19:13,404 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:19:13,406 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:19:13,413 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:19:13,414 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:19:13,415 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:19:13,416 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:19:13,418 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:19:13,419 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:19:13,428 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:19:13,430 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:19:13,431 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:19:13,433 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:19:13,434 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:19:13,437 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:19:13,438 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:19:13,443 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:19:13,444 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:19:13,446 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:19:13,447 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:19:13,448 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:19:13,450 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:19:13,451 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:19:13,452 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:19:13,453 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:19:13,455 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:19:13,458 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:19:13,459 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:19:13,460 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:19:13,462 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:19:13,463 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:19:13,465 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:19:13,466 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:19:13,468 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:19:13,469 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:19:13,471 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:19:13,472 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:19:13,474 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:19:13,475 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:19:13,481 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:19:13,484 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:19:14,044 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:14,044 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:14,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,045 INFO L229 MonitoredProcess]: Starting monitored process 49 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:19:14,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-26 14:19:14,047 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:19:14,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:14,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:14,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:14,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:14,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:14,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:14,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:14,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:14,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-26 14:19:14,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,085 INFO L229 MonitoredProcess]: Starting monitored process 50 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:19:14,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-26 14:19:14,086 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:19:14,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:14,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:14,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:14,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:14,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:14,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:14,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:14,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,111 INFO L229 MonitoredProcess]: Starting monitored process 51 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:19:14,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-26 14:19:14,116 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:19:14,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:14,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:14,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:14,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:14,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:14,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:14,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:14,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:14,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,142 INFO L229 MonitoredProcess]: Starting monitored process 52 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:19:14,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-26 14:19:14,144 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:19:14,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:14,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:14,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:14,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:14,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:14,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:14,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:14,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-26 14:19:14,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,172 INFO L229 MonitoredProcess]: Starting monitored process 53 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:19:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-26 14:19:14,174 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:19:14,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:14,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:14,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:14,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:14,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:14,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:14,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:14,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-26 14:19:14,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,200 INFO L229 MonitoredProcess]: Starting monitored process 54 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:19:14,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-26 14:19:14,202 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:19:14,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:14,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:14,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:14,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:14,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:14,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:14,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:14,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-26 14:19:14,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,235 INFO L229 MonitoredProcess]: Starting monitored process 55 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:19:14,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-26 14:19:14,237 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:19:14,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:14,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:14,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:14,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:14,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:14,249 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:14,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:14,289 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-26 14:19:14,289 INFO L444 ModelExtractionUtils]: 13 out of 46 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-07-26 14:19:14,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:14,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:14,290 INFO L229 MonitoredProcess]: Starting monitored process 56 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:19:14,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-26 14:19:14,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:14,297 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 14:19:14,297 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:14,297 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, ~front~0) = 1*~back~0 - 1*~front~0 Supporting invariants [] [2022-07-26 14:19:14,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:14,407 INFO L156 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2022-07-26 14:19:14,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:14,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 14:19:14,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:14,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 14:19:14,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:14,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:14,514 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:19:14,515 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:19:14,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 281 states and 875 transitions. cyclomatic complexity: 643 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:19:14,556 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 281 states and 875 transitions. cyclomatic complexity: 643. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 761 states and 2307 transitions. Complement of second has 5 states. [2022-07-26 14:19:14,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:19:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-07-26 14:19:14,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-26 14:19:14,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:14,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-26 14:19:14,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:14,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-26 14:19:14,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:14,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 761 states and 2307 transitions. [2022-07-26 14:19:14,564 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-26 14:19:14,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 761 states to 473 states and 1427 transitions. [2022-07-26 14:19:14,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2022-07-26 14:19:14,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2022-07-26 14:19:14,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 473 states and 1427 transitions. [2022-07-26 14:19:14,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 14:19:14,567 INFO L220 hiAutomatonCegarLoop]: Abstraction has 473 states and 1427 transitions. [2022-07-26 14:19:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states and 1427 transitions. [2022-07-26 14:19:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 292. [2022-07-26 14:19:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 292 states have (on average 3.089041095890411) internal successors, (902), 291 states have internal predecessors, (902), 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:19:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 902 transitions. [2022-07-26 14:19:14,575 INFO L242 hiAutomatonCegarLoop]: Abstraction has 292 states and 902 transitions. [2022-07-26 14:19:14,575 INFO L426 stractBuchiCegarLoop]: Abstraction has 292 states and 902 transitions. [2022-07-26 14:19:14,575 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 14:19:14,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 902 transitions. [2022-07-26 14:19:14,576 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-26 14:19:14,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 14:19:14,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 14:19:14,577 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 14:19:14,577 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 14:19:14,577 INFO L733 eck$LassoCheckResult]: Stem: 6216#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, 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_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6058#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 6060#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 5844#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 5846#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 6182#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 6088#[L108-4, L55]don't care [575] L108-4-->L109-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_110| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (store |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_90|) (= (select |v_#valid_143| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_37|)) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_91|, #length=|v_#length_110|, 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|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_13|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_90|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 5928#[L55, L109-3]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6086#[L55, L109-4, thread2ENTRY]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_12) InVars {~v_assert~0=v_~v_assert~0_12} OutVars{~v_assert~0=v_~v_assert~0_12, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 6172#[L55, L109-4, L81]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 6342#[L109-4, L81, L48-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 6072#[L55, L109-4, L81]don't care [2022-07-26 14:19:14,578 INFO L735 eck$LassoCheckResult]: Loop: 6072#[L55, L109-4, L81]don't care [522] L81-->L75: Formula: (let ((.cse0 (* v_~front~0_41 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_29))) (and (<= (+ .cse0 4 v_~queue~0.offset_29) (select |v_#length_74| v_~queue~0.base_29)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_34)) 1 0)) (= (select |v_#valid_95| v_~queue~0.base_29) 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0)) (= v_~front~0_40 (+ v_~front~0_41 1)) (= (select (select |v_#memory_int_62| v_~queue~0.base_29) .cse1) |v_thread2Thread1of1ForFork1_~temp~0#1_11|) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_95|, ~back~0=v_~back~0_50, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_34, ~front~0=v_~front~0_41} OutVars{~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_11|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~n~0=v_~n~0_34, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 6030#[L75, L55, L109-4]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 6154#[L78, L55, L109-4]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 6072#[L55, L109-4, L81]don't care [2022-07-26 14:19:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash 446121594, now seen corresponding path program 2 times [2022-07-26 14:19:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:14,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178363177] [2022-07-26 14:19:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:14,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:14,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:14,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 4 times [2022-07-26 14:19:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:14,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459147062] [2022-07-26 14:19:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:14,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:14,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1780108881, now seen corresponding path program 2 times [2022-07-26 14:19:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 14:19:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092686382] [2022-07-26 14:19:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 14:19:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 14:19:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:14,659 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 14:19:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 14:19:14,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 14:19:16,293 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 14:19:16,293 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 14:19:16,293 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 14:19:16,293 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 14:19:16,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 14:19:16,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:16,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 14:19:16,294 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 14:19:16,294 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration7_Lasso [2022-07-26 14:19:16,294 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 14:19:16,294 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 14:19:16,296 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:19:16,300 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:19:16,302 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:19:16,303 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:19:16,305 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:19:16,306 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:19:16,308 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:19:16,309 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:19:16,312 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:19:16,314 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:19:16,978 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:19:16,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:19:16,981 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:19:16,984 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:19:16,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:19:16,987 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:19:16,988 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:19:16,990 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:19:16,991 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:19:16,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:19:16,995 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:19:16,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:19:16,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:19:17,000 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:19:17,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:19:17,011 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:19:17,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:19:17,013 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:19:17,015 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:19:17,016 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:19:17,018 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:19:17,019 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:19:17,030 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:19:17,032 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:19:17,033 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:19:17,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:19:17,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:19:17,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:19:17,038 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:19:17,041 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:19:17,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:19:17,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:19:17,045 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:19:17,051 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:19:17,052 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:19:17,610 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 14:19:17,610 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 14:19:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,611 INFO L229 MonitoredProcess]: Starting monitored process 57 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:19:17,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-26 14:19:17,614 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:19:17,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-26 14:19:17,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,647 INFO L229 MonitoredProcess]: Starting monitored process 58 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:19:17,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-26 14:19:17,648 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:19:17,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:17,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,655 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:17,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:17,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:17,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,671 INFO L229 MonitoredProcess]: Starting monitored process 59 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:19:17,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-26 14:19:17,673 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:19:17,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-26 14:19:17,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,705 INFO L229 MonitoredProcess]: Starting monitored process 60 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:19:17,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-26 14:19:17,715 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:19:17,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-26 14:19:17,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,739 INFO L229 MonitoredProcess]: Starting monitored process 61 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:19:17,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-26 14:19:17,741 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:19:17,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:17,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:17,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:17,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-26 14:19:17,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,763 INFO L229 MonitoredProcess]: Starting monitored process 62 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:19:17,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-26 14:19:17,765 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:19:17,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:17,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:17,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:17,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-26 14:19:17,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,787 INFO L229 MonitoredProcess]: Starting monitored process 63 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:19:17,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-26 14:19:17,789 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:19:17,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:17,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:17,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:17,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-26 14:19:17,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,812 INFO L229 MonitoredProcess]: Starting monitored process 64 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:19:17,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-26 14:19:17,814 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:19:17,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-26 14:19:17,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,840 INFO L229 MonitoredProcess]: Starting monitored process 65 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:19:17,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-26 14:19:17,842 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:19:17,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 14:19:17,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 14:19:17,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 14:19:17,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:17,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,865 INFO L229 MonitoredProcess]: Starting monitored process 66 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:19:17,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-26 14:19:17,867 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:19:17,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-26 14:19:17,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,900 INFO L229 MonitoredProcess]: Starting monitored process 67 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:19:17,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-26 14:19:17,902 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:19:17,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:17,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,931 INFO L229 MonitoredProcess]: Starting monitored process 68 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:19:17,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-26 14:19:17,933 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:19:17,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-26 14:19:17,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,959 INFO L229 MonitoredProcess]: Starting monitored process 69 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:19:17,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-26 14:19:17,961 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:19:17,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:17,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-26 14:19:17,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:17,986 INFO L229 MonitoredProcess]: Starting monitored process 70 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:19:17,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-26 14:19:17,988 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:19:17,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:17,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:17,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:17,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:17,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:17,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:17,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:18,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:18,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:18,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:18,014 INFO L229 MonitoredProcess]: Starting monitored process 71 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:19:18,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-26 14:19:18,016 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:19:18,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:18,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:18,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:18,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:18,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:18,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:18,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:18,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:18,042 INFO L229 MonitoredProcess]: Starting monitored process 72 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:19:18,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-26 14:19:18,043 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:19:18,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:18,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:18,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:18,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:18,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:18,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:18,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:18,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-26 14:19:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:18,069 INFO L229 MonitoredProcess]: Starting monitored process 73 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:19:18,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-26 14:19:18,071 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:19:18,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:18,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:18,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:18,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:18,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:18,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:18,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:18,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:18,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:18,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:18,096 INFO L229 MonitoredProcess]: Starting monitored process 74 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:19:18,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-26 14:19:18,098 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:19:18,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:18,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:18,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:18,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:18,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:18,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:18,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 14:19:18,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-26 14:19:18,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:18,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:18,123 INFO L229 MonitoredProcess]: Starting monitored process 75 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:19:18,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-26 14:19:18,125 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:19:18,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 14:19:18,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 14:19:18,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 14:19:18,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 14:19:18,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 14:19:18,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 14:19:18,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 14:19:18,175 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-07-26 14:19:18,175 INFO L444 ModelExtractionUtils]: 5 out of 43 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-07-26 14:19:18,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 14:19:18,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 14:19:18,176 INFO L229 MonitoredProcess]: Starting monitored process 76 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:19:18,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-26 14:19:18,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 14:19:18,183 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 14:19:18,184 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 14:19:18,184 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~queue~0.base)_4, ~front~0) = 1*v_rep(select #length ~queue~0.base)_4 - 2*~front~0 Supporting invariants [1*~queue~0.offset >= 0] [2022-07-26 14:19:18,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:18,298 INFO L156 tatePredicateManager]: 38 out of 39 supporting invariants were superfluous and have been removed [2022-07-26 14:19:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 14:19:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:18,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-26 14:19:18,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 14:19:18,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-26 14:19:18,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 14:19:18,420 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:19:18,421 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-26 14:19:18,421 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 292 states and 902 transitions. cyclomatic complexity: 659 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:19:18,478 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 292 states and 902 transitions. cyclomatic complexity: 659. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 687 states and 2199 transitions. Complement of second has 5 states. [2022-07-26 14:19:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 14:19:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:19:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-07-26 14:19:18,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 3 letters. [2022-07-26 14:19:18,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:18,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 14 letters. Loop has 3 letters. [2022-07-26 14:19:18,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:18,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 11 letters. Loop has 6 letters. [2022-07-26 14:19:18,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 14:19:18,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 2199 transitions. [2022-07-26 14:19:18,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:19:18,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 0 states and 0 transitions. [2022-07-26 14:19:18,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 14:19:18,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 14:19:18,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 14:19:18,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 14:19:18,484 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:19:18,484 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:19:18,484 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 14:19:18,484 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 14:19:18,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 14:19:18,484 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 14:19:18,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 14:19:18,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 02:19:18 BoogieIcfgContainer [2022-07-26 14:19:18,489 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 14:19:18,489 INFO L158 Benchmark]: Toolchain (without parser) took 24024.23ms. Allocated memory was 172.0MB in the beginning and 286.3MB in the end (delta: 114.3MB). Free memory was 113.3MB in the beginning and 161.1MB in the end (delta: -47.8MB). Peak memory consumption was 66.7MB. Max. memory is 8.0GB. [2022-07-26 14:19:18,489 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 14:19:18,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.33ms. Allocated memory was 172.0MB in the beginning and 238.0MB in the end (delta: 66.1MB). Free memory was 113.1MB in the beginning and 210.8MB in the end (delta: -97.7MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-07-26 14:19:18,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.18ms. Allocated memory is still 238.0MB. Free memory was 210.8MB in the beginning and 208.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 14:19:18,490 INFO L158 Benchmark]: Boogie Preprocessor took 25.56ms. Allocated memory is still 238.0MB. Free memory was 208.9MB in the beginning and 207.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 14:19:18,490 INFO L158 Benchmark]: RCFGBuilder took 491.69ms. Allocated memory is still 238.0MB. Free memory was 207.3MB in the beginning and 185.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-07-26 14:19:18,490 INFO L158 Benchmark]: BuchiAutomizer took 23134.29ms. Allocated memory was 238.0MB in the beginning and 286.3MB in the end (delta: 48.2MB). Free memory was 185.3MB in the beginning and 161.1MB in the end (delta: 24.2MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2022-07-26 14:19:18,491 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.10ms. Allocated memory is still 172.0MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 321.33ms. Allocated memory was 172.0MB in the beginning and 238.0MB in the end (delta: 66.1MB). Free memory was 113.1MB in the beginning and 210.8MB in the end (delta: -97.7MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.18ms. Allocated memory is still 238.0MB. Free memory was 210.8MB in the beginning and 208.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.56ms. Allocated memory is still 238.0MB. Free memory was 208.9MB in the beginning and 207.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 491.69ms. Allocated memory is still 238.0MB. Free memory was 207.3MB in the beginning and 185.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 23134.29ms. Allocated memory was 238.0MB in the beginning and 286.3MB in the end (delta: 48.2MB). Free memory was 185.3MB in the beginning and 161.1MB in the end (delta: 24.2MB). Peak memory consumption was 73.4MB. 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 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[arr] + -2 * i and consists of 4 locations. One deterministic module has affine ranking function n + -1 * back and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[queue] + -2 * front and consists of 6 locations. One deterministic module has affine ranking function -1 * front + back and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[queue] + -2 * front and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.0s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 17.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 295 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 307 IncrementalHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 27 mSDtfsCounter, 307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital376 mio100 ax110 hnf100 lsp77 ukn69 mio100 lsp39 div113 bol100 ite100 ukn100 eq178 hnf91 smp85 dnf100 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms 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: 4.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 147 PlacesBefore, 32 PlacesAfterwards, 148 TransitionsBefore, 25 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 7 FixpointIterations, 93 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 7 ConcurrentYvCompositions, 8 ChoiceCompositions, 145 TotalNumberOfCompositions, 1971 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1546, positive: 1473, positive conditional: 0, positive unconditional: 1473, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 636, positive: 614, positive conditional: 0, positive unconditional: 614, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1546, positive: 859, positive conditional: 0, positive unconditional: 859, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 636, unknown conditional: 0, unknown unconditional: 636] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 RESULT: Ultimate proved your program to be correct! [2022-07-26 14:19:18,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-26 14:19:18,717 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...