/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:57:10,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:57:10,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:57:10,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:57:10,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:57:10,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:57:10,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:57:10,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:57:10,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:57:10,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:57:10,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:57:10,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:57:10,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:57:10,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:57:10,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:57:10,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:57:10,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:57:10,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:57:10,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:57:10,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:57:10,724 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:57:10,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:57:10,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:57:10,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:57:10,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:57:10,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:57:10,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:57:10,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:57:10,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:57:10,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:57:10,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:57:10,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:57:10,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:57:10,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:57:10,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:57:10,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:57:10,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:57:10,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:57:10,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:57:10,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:57:10,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:57:10,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:57:10,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:57:10,764 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:57:10,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:57:10,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:57:10,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:57:10,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:57:10,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:57:10,766 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:57:10,766 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:57:10,766 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:57:10,767 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:57:10,767 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:57:10,767 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:57:10,767 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:57:10,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:57:10,768 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:57:10,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:57:10,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:57:10,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:57:10,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:57:10,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:57:10,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:57:10,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:57:10,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:57:10,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:57:10,770 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:57:10,770 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 13:57:10,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:57:10,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:57:10,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:57:10,965 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:57:10,968 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:57:10,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-07-26 13:57:11,020 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cdf5fd5/78ad8999017f4a57931c642098b06a1e/FLAG74fe57d7d [2022-07-26 13:57:11,356 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:57:11,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-07-26 13:57:11,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cdf5fd5/78ad8999017f4a57931c642098b06a1e/FLAG74fe57d7d [2022-07-26 13:57:11,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39cdf5fd5/78ad8999017f4a57931c642098b06a1e [2022-07-26 13:57:11,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:57:11,372 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:57:11,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:57:11,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:57:11,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:57:11,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629453f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11, skipping insertion in model container [2022-07-26 13:57:11,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:57:11,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:57:11,597 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-send-receive.wvr.c[3107,3120] [2022-07-26 13:57:11,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:57:11,607 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:57:11,637 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-send-receive.wvr.c[3107,3120] [2022-07-26 13:57:11,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:57:11,650 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:57:11,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11 WrapperNode [2022-07-26 13:57:11,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:57:11,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:57:11,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:57:11,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:57:11,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,693 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 158 [2022-07-26 13:57:11,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:57:11,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:57:11,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:57:11,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:57:11,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:57:11,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:57:11,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:57:11,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:57:11,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (1/1) ... [2022-07-26 13:57:11,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:11,752 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 13:57:11,760 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 13:57:11,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:57:11,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:57:11,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:57:11,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:57:11,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 13:57:11,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 13:57:11,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 13:57:11,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 13:57:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-26 13:57:11,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-26 13:57:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:57:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-26 13:57:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-26 13:57:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-26 13:57:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:57:11,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:57:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:57:11,796 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 13:57:11,852 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:57:11,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:57:12,126 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:57:12,190 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:57:12,190 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-26 13:57:12,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:57:12 BoogieIcfgContainer [2022-07-26 13:57:12,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:57:12,194 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:57:12,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:57:12,197 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:57:12,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:57:12,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:57:11" (1/3) ... [2022-07-26 13:57:12,198 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c4f297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:57:12, skipping insertion in model container [2022-07-26 13:57:12,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:57:12,198 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:57:11" (2/3) ... [2022-07-26 13:57:12,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c4f297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:57:12, skipping insertion in model container [2022-07-26 13:57:12,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:57:12,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:57:12" (3/3) ... [2022-07-26 13:57:12,201 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-07-26 13:57:12,280 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-26 13:57:12,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 141 transitions, 306 flow [2022-07-26 13:57:12,328 INFO L129 PetriNetUnfolder]: 10/135 cut-off events. [2022-07-26 13:57:12,329 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 13:57:12,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 10/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-26 13:57:12,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 141 transitions, 306 flow [2022-07-26 13:57:12,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 135 transitions, 288 flow [2022-07-26 13:57:12,339 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:57:12,347 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 135 transitions, 288 flow [2022-07-26 13:57:12,349 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 135 transitions, 288 flow [2022-07-26 13:57:12,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 288 flow [2022-07-26 13:57:12,365 INFO L129 PetriNetUnfolder]: 10/135 cut-off events. [2022-07-26 13:57:12,365 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-26 13:57:12,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 10/135 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-26 13:57:12,367 INFO L116 LiptonReduction]: Number of co-enabled transitions 1308 [2022-07-26 13:57:15,890 INFO L131 LiptonReduction]: Checked pairs total: 2030 [2022-07-26 13:57:15,891 INFO L133 LiptonReduction]: Total number of compositions: 129 [2022-07-26 13:57:15,903 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:57:15,903 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:57:15,903 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:57:15,903 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:57:15,903 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:57:15,903 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:57:15,903 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:57:15,903 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:57:15,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:57:15,938 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 85 [2022-07-26 13:57:15,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:15,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:15,942 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 13:57:15,942 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:15,943 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:57:15,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 128 states, but on-demand construction may add more states [2022-07-26 13:57:15,949 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 85 [2022-07-26 13:57:15,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:15,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:15,949 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-26 13:57:15,949 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-26 13:57:15,952 INFO L733 eck$LassoCheckResult]: Stem: 141#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 144#[L127-6]don't care [2022-07-26 13:57:15,953 INFO L735 eck$LassoCheckResult]: Loop: 144#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 144#[L127-6]don't care [2022-07-26 13:57:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:15,956 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2022-07-26 13:57:15,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:15,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146323638] [2022-07-26 13:57:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:16,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:16,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2022-07-26 13:57:16,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:16,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472514728] [2022-07-26 13:57:16,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:16,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:16,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:16,088 INFO L85 PathProgramCache]: Analyzing trace with hash 19312, now seen corresponding path program 1 times [2022-07-26 13:57:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:16,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260276849] [2022-07-26 13:57:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:16,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:16,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:16,705 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:16,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:16,706 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:16,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:16,706 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:16,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:16,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:16,706 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:16,706 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration1_Lasso [2022-07-26 13:57:16,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:16,707 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:16,722 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,996 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:16,998 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57: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 13:57:17,002 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,005 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57: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 13:57: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 13:57:17,017 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,020 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,022 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,025 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,027 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,029 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,031 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57: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 13:57: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 13:57:17,035 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57: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 13:57: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 13:57:17,039 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57: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 13:57: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 13:57: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 13:57:17,046 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,048 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,049 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57: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 13:57:17,055 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,058 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,059 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,061 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,063 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,065 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,066 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,068 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:17,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 13:57:17,433 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:17,435 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:17,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,438 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 13:57:17,438 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 13:57:17,439 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 13:57:17,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:17,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:17,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:17,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:17,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:17,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:17,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:17,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:17,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,484 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 13:57:17,485 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 13:57:17,486 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 13:57:17,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:17,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:17,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:17,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:17,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:17,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:17,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:17,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-26 13:57:17,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,526 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 13:57:17,527 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 13:57:17,528 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 13:57:17,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:17,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:17,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:17,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:17,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:17,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:17,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:17,571 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 13:57:17,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,572 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 13:57:17,573 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 13:57:17,575 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 13:57:17,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:17,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:17,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:17,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:17,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:17,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:17,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:17,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:17,631 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 13:57:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,634 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 13:57:17,635 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 13:57:17,636 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 13:57:17,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:17,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:17,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:17,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:17,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:17,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:17,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:17,678 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 13:57:17,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,679 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 13:57:17,680 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 13:57:17,681 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 13:57:17,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:17,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:17,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:17,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:17,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:17,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:17,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:17,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:17,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,720 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 13:57:17,721 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 13:57:17,722 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 13:57:17,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:17,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:17,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:17,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:17,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:17,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:17,748 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:17,765 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-26 13:57:17,765 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-26 13:57:17,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:17,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:17,767 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 13:57:17,768 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 13:57:17,769 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:17,796 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:57:17,797 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:17,797 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, 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*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [] [2022-07-26 13:57:17,815 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 13:57:17,867 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-26 13:57:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:17,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:57:17,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:17,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 13:57:17,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:17,918 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 13:57:17,935 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 13:57:17,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 128 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 13:57:18,007 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 128 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 256 states and 712 transitions. Complement of second has 5 states. [2022-07-26 13:57:18,019 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 13:57:18,022 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 13:57:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-07-26 13:57:18,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-26 13:57:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:18,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-26 13:57:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:18,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-26 13:57:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:18,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256 states and 712 transitions. [2022-07-26 13:57:18,031 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-26 13:57:18,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256 states to 114 states and 322 transitions. [2022-07-26 13:57:18,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2022-07-26 13:57:18,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-07-26 13:57:18,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 322 transitions. [2022-07-26 13:57:18,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:18,038 INFO L220 hiAutomatonCegarLoop]: Abstraction has 114 states and 322 transitions. [2022-07-26 13:57:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 322 transitions. [2022-07-26 13:57:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-26 13:57:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 2.824561403508772) internal successors, (322), 113 states have internal predecessors, (322), 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 13:57:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 322 transitions. [2022-07-26 13:57:18,072 INFO L242 hiAutomatonCegarLoop]: Abstraction has 114 states and 322 transitions. [2022-07-26 13:57:18,072 INFO L426 stractBuchiCegarLoop]: Abstraction has 114 states and 322 transitions. [2022-07-26 13:57:18,072 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:57:18,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 322 transitions. [2022-07-26 13:57:18,078 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-26 13:57:18,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:18,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:18,078 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 13:57:18,078 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:18,079 INFO L733 eck$LassoCheckResult]: Stem: 987#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 983#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 967#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 969#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 895#[L59, L110-4]don't care [2022-07-26 13:57:18,081 INFO L735 eck$LassoCheckResult]: Loop: 895#[L59, L110-4]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 899#[L56, L110-4]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 895#[L59, L110-4]don't care [2022-07-26 13:57:18,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 18566984, now seen corresponding path program 1 times [2022-07-26 13:57:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789223527] [2022-07-26 13:57:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,122 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 1 times [2022-07-26 13:57:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363119030] [2022-07-26 13:57:18,193 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 13:57:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 663018070, now seen corresponding path program 1 times [2022-07-26 13:57:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710685220] [2022-07-26 13:57:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:18,266 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 13:57:18,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:57:18,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710685220] [2022-07-26 13:57:18,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710685220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:57:18,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:57:18,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:57:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168247712] [2022-07-26 13:57:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:57:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:57:18,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:57:18,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:57:18,339 INFO L87 Difference]: Start difference. First operand 114 states and 322 transitions. cyclomatic complexity: 245 Second operand has 4 states, 4 states have (on average 1.5) 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 13:57:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:57:18,401 INFO L93 Difference]: Finished difference Result 177 states and 457 transitions. [2022-07-26 13:57:18,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 457 transitions. [2022-07-26 13:57:18,403 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-26 13:57:18,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 114 states and 321 transitions. [2022-07-26 13:57:18,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-07-26 13:57:18,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-07-26 13:57:18,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 321 transitions. [2022-07-26 13:57:18,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:18,405 INFO L220 hiAutomatonCegarLoop]: Abstraction has 114 states and 321 transitions. [2022-07-26 13:57:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 321 transitions. [2022-07-26 13:57:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-26 13:57:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 2.8157894736842106) internal successors, (321), 113 states have internal predecessors, (321), 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 13:57:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 321 transitions. [2022-07-26 13:57:18,409 INFO L242 hiAutomatonCegarLoop]: Abstraction has 114 states and 321 transitions. [2022-07-26 13:57:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-26 13:57:18,410 INFO L426 stractBuchiCegarLoop]: Abstraction has 114 states and 321 transitions. [2022-07-26 13:57:18,410 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:57:18,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 321 transitions. [2022-07-26 13:57:18,411 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-26 13:57:18,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:18,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:18,411 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-26 13:57:18,411 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:18,412 INFO L733 eck$LassoCheckResult]: Stem: 1403#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 1399#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 1401#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 1383#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 1385#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1307#[L59, L110-4]don't care [2022-07-26 13:57:18,412 INFO L735 eck$LassoCheckResult]: Loop: 1307#[L59, L110-4]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 1311#[L56, L110-4]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1307#[L59, L110-4]don't care [2022-07-26 13:57:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 575867221, now seen corresponding path program 1 times [2022-07-26 13:57:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455238125] [2022-07-26 13:57:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 2 times [2022-07-26 13:57:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89908111] [2022-07-26 13:57:18,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,445 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:18,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,449 INFO L85 PathProgramCache]: Analyzing trace with hash -642366173, now seen corresponding path program 1 times [2022-07-26 13:57:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652431557] [2022-07-26 13:57:18,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:18,500 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 13:57:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:57:18,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652431557] [2022-07-26 13:57:18,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652431557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:57:18,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:57:18,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:57:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945099794] [2022-07-26 13:57:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:57:18,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:57:18,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:57:18,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:57:18,575 INFO L87 Difference]: Start difference. First operand 114 states and 321 transitions. cyclomatic complexity: 244 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:57:18,605 INFO L93 Difference]: Finished difference Result 140 states and 379 transitions. [2022-07-26 13:57:18,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 379 transitions. [2022-07-26 13:57:18,606 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2022-07-26 13:57:18,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 128 states and 349 transitions. [2022-07-26 13:57:18,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2022-07-26 13:57:18,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2022-07-26 13:57:18,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 349 transitions. [2022-07-26 13:57:18,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:18,609 INFO L220 hiAutomatonCegarLoop]: Abstraction has 128 states and 349 transitions. [2022-07-26 13:57:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 349 transitions. [2022-07-26 13:57:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2022-07-26 13:57:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 2.7711864406779663) internal successors, (327), 117 states have internal predecessors, (327), 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 13:57:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 327 transitions. [2022-07-26 13:57:18,613 INFO L242 hiAutomatonCegarLoop]: Abstraction has 118 states and 327 transitions. [2022-07-26 13:57:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:57:18,614 INFO L426 stractBuchiCegarLoop]: Abstraction has 118 states and 327 transitions. [2022-07-26 13:57:18,614 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:57:18,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 327 transitions. [2022-07-26 13:57:18,615 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2022-07-26 13:57:18,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:18,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:18,615 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:18,615 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:18,616 INFO L733 eck$LassoCheckResult]: Stem: 1783#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 1777#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 1779#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 1763#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 1765#[thread1ENTRY, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} 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_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 1613#[thread1ENTRY, L111-3]don't care [439] L111-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_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, 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~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1617#[thread2ENTRY, thread1ENTRY, L111-4]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 1775#[thread1ENTRY, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 1755#[L81, thread1ENTRY, L111-4]don't care [2022-07-26 13:57:18,616 INFO L735 eck$LassoCheckResult]: Loop: 1755#[L81, thread1ENTRY, L111-4]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 1757#[thread1ENTRY, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 1755#[L81, thread1ENTRY, L111-4]don't care [2022-07-26 13:57:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1565608749, now seen corresponding path program 1 times [2022-07-26 13:57:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266374500] [2022-07-26 13:57:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 17806, now seen corresponding path program 1 times [2022-07-26 13:57:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455799000] [2022-07-26 13:57:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,664 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:18,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1311471034, now seen corresponding path program 1 times [2022-07-26 13:57:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:18,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234571981] [2022-07-26 13:57:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:57:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:57:18,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234571981] [2022-07-26 13:57:18,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234571981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 13:57:18,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288320334] [2022-07-26 13:57:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:18,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 13:57:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:18,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 13:57:18,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-26 13:57:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:18,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-26 13:57:18,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:18,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-26 13:57:18,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2022-07-26 13:57:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:57:18,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 13:57:19,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 142 [2022-07-26 13:57:19,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2022-07-26 13:57:19,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2022-07-26 13:57:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:57:19,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288320334] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 13:57:19,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 13:57:19,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2022-07-26 13:57:19,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323174653] [2022-07-26 13:57:19,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 13:57:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:57:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-26 13:57:19,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-07-26 13:57:19,332 INFO L87 Difference]: Start difference. First operand 118 states and 327 transitions. cyclomatic complexity: 238 Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 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 13:57:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:57:19,639 INFO L93 Difference]: Finished difference Result 262 states and 687 transitions. [2022-07-26 13:57:19,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 687 transitions. [2022-07-26 13:57:19,641 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 108 [2022-07-26 13:57:19,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 212 states and 563 transitions. [2022-07-26 13:57:19,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2022-07-26 13:57:19,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2022-07-26 13:57:19,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 563 transitions. [2022-07-26 13:57:19,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:19,644 INFO L220 hiAutomatonCegarLoop]: Abstraction has 212 states and 563 transitions. [2022-07-26 13:57:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 563 transitions. [2022-07-26 13:57:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2022-07-26 13:57:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 2.739130434782609) internal successors, (504), 183 states have internal predecessors, (504), 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 13:57:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 504 transitions. [2022-07-26 13:57:19,650 INFO L242 hiAutomatonCegarLoop]: Abstraction has 184 states and 504 transitions. [2022-07-26 13:57:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-26 13:57:19,650 INFO L426 stractBuchiCegarLoop]: Abstraction has 184 states and 504 transitions. [2022-07-26 13:57:19,651 INFO L333 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-26 13:57:19,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 504 transitions. [2022-07-26 13:57:19,652 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 92 [2022-07-26 13:57:19,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:19,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:19,652 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:19,652 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:19,653 INFO L733 eck$LassoCheckResult]: Stem: 2388#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 2380#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 2382#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 2360#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 2362#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 2266#[L59, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} 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_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 2196#[L59, L111-3]don't care [439] L111-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_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, 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~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2368#[thread2ENTRY, L111-4, L59]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 2370#[L86, L111-4, L59]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 2174#[L81, L111-4, L59]don't care [2022-07-26 13:57:19,653 INFO L735 eck$LassoCheckResult]: Loop: 2174#[L81, L111-4, L59]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 2170#[L81, L111-4, L56]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 2174#[L81, L111-4, L59]don't care [2022-07-26 13:57:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:19,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1162962085, now seen corresponding path program 1 times [2022-07-26 13:57:19,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:19,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242043531] [2022-07-26 13:57:19,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:19,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:19,675 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:19,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 3 times [2022-07-26 13:57:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:19,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638644672] [2022-07-26 13:57:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:19,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:19,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:19,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 915082355, now seen corresponding path program 1 times [2022-07-26 13:57:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:19,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565170324] [2022-07-26 13:57:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:19,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:19,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:21,252 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:21,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:21,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:21,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:21,252 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:21,253 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:21,253 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:21,253 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:21,253 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration5_Lasso [2022-07-26 13:57:21,253 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:21,253 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:21,257 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,264 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,265 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,267 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,268 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,270 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,271 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,273 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,983 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:21,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 13:57:21,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 13:57:21,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 13:57:21,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 13:57:21,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 13:57:21,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 13:57:21,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 13:57:21,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 13:57:21,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 13:57:21,998 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,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 13:57:22,001 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,003 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,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 13:57:22,008 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,010 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,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 13:57:22,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 13:57:22,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 13:57:22,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 13:57:22,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 13:57:22,021 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,023 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,024 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,026 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,027 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,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 13:57:22,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 13:57:22,035 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,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 13:57:22,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 13:57:22,039 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,040 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,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 13:57:22,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 13:57:22,046 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:22,622 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:22,622 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:22,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,623 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 13:57:22,624 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 13:57:22,625 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 13:57:22,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:22,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:22,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,677 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 13:57:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,678 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 13:57:22,679 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 13:57:22,680 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 13:57:22,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:22,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:22,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:22,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,716 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 13:57:22,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,717 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 13:57:22,718 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 13:57:22,719 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 13:57:22,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:22,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:22,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:22,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,745 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 13:57:22,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,746 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 13:57:22,746 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 13:57:22,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 13:57:22,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:22,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:22,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:22,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-26 13:57:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,812 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 13:57:22,812 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 13:57:22,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 13:57:22,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:22,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:22,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,840 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 13:57:22,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,841 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 13:57:22,842 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 13:57:22,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 13:57:22,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:22,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:22,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:22,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,865 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 13:57:22,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,866 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 13:57:22,867 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 13:57:22,869 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 13:57:22,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:22,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:22,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,893 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 13:57:22,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,894 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 13:57:22,896 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 13:57:22,896 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 13:57:22,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:22,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:22,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-26 13:57:22,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,940 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 13:57:22,941 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 13:57:22,943 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 13:57:22,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:22,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:22,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:22,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:22,979 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 13:57:22,982 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 13:57:22,983 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 13:57:22,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:22,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:22,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:22,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:22,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:22,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:22,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:23,006 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 13:57:23,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:23,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:23,007 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 13:57:23,008 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 13:57:23,009 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 13:57:23,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:23,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:23,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:23,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:23,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:23,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:23,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:23,033 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 13:57:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:23,034 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 13:57:23,035 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 13:57:23,036 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 13:57:23,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:23,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:23,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:23,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:23,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:23,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:23,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:23,061 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 13:57:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:23,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:23,062 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 13:57:23,062 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 13:57:23,065 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 13:57:23,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:23,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:23,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:23,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:23,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:23,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:23,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:23,088 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 13:57:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:23,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:23,089 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 13:57:23,090 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 13:57:23,091 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 13:57:23,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:23,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:23,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:23,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:23,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:23,103 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:23,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:23,140 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-26 13:57:23,140 INFO L444 ModelExtractionUtils]: 22 out of 40 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-07-26 13:57:23,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:23,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:23,142 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 13:57:23,142 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 13:57:23,143 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:23,164 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:57:23,164 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:23,164 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 13:57:23,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:23,274 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-07-26 13:57:23,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:23,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:57:23,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:23,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-26 13:57:23,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:23,345 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 13:57:23,346 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 13:57:23,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 184 states and 504 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13:57:23,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 184 states and 504 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 530 states and 1609 transitions. Complement of second has 5 states. [2022-07-26 13:57:23,390 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 13:57:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13:57:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-07-26 13:57:23,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 13:57:23,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:23,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 13:57:23,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:23,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-26 13:57:23,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:23,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 1609 transitions. [2022-07-26 13:57:23,396 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2022-07-26 13:57:23,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 306 states and 889 transitions. [2022-07-26 13:57:23,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2022-07-26 13:57:23,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2022-07-26 13:57:23,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 889 transitions. [2022-07-26 13:57:23,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:57:23,399 INFO L220 hiAutomatonCegarLoop]: Abstraction has 306 states and 889 transitions. [2022-07-26 13:57:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 889 transitions. [2022-07-26 13:57:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2022-07-26 13:57:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 211 states have (on average 3.090047393364929) internal successors, (652), 210 states have internal predecessors, (652), 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 13:57:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 652 transitions. [2022-07-26 13:57:23,405 INFO L242 hiAutomatonCegarLoop]: Abstraction has 211 states and 652 transitions. [2022-07-26 13:57:23,405 INFO L426 stractBuchiCegarLoop]: Abstraction has 211 states and 652 transitions. [2022-07-26 13:57:23,405 INFO L333 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-26 13:57:23,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 652 transitions. [2022-07-26 13:57:23,406 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2022-07-26 13:57:23,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:23,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:23,407 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:23,407 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:23,407 INFO L733 eck$LassoCheckResult]: Stem: 3591#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 3579#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 3581#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 3583#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 3547#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 3549#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 3391#[L59, L110-4]don't care [514] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_9| 0) (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_17| 256) 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_9| 0)) InVars {thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_17|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] 3393#[thread1EXIT, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} 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_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 3569#[thread1EXIT, L111-3]don't care [439] L111-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_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, 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~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3359#[thread2ENTRY, thread1EXIT, L111-4]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 3357#[thread1EXIT, L86, L111-4]don't care [2022-07-26 13:57:23,408 INFO L735 eck$LassoCheckResult]: Loop: 3357#[thread1EXIT, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 3353#[L81, thread1EXIT, L111-4]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 3357#[thread1EXIT, L86, L111-4]don't care [2022-07-26 13:57:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash -905859760, now seen corresponding path program 1 times [2022-07-26 13:57:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:23,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557263271] [2022-07-26 13:57:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-26 13:57:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:57:23,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557263271] [2022-07-26 13:57:23,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557263271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:57:23,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:57:23,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-26 13:57:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279918970] [2022-07-26 13:57:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:57:23,435 INFO L738 eck$LassoCheckResult]: stem already infeasible [2022-07-26 13:57:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash 19156, now seen corresponding path program 2 times [2022-07-26 13:57:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:23,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580107704] [2022-07-26 13:57:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:23,439 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:23,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:57:23,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-26 13:57:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-26 13:57:23,669 INFO L87 Difference]: Start difference. First operand 211 states and 652 transitions. cyclomatic complexity: 482 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:57:23,720 INFO L93 Difference]: Finished difference Result 227 states and 663 transitions. [2022-07-26 13:57:23,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 663 transitions. [2022-07-26 13:57:23,722 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 64 [2022-07-26 13:57:23,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 227 states and 663 transitions. [2022-07-26 13:57:23,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 168 [2022-07-26 13:57:23,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2022-07-26 13:57:23,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 663 transitions. [2022-07-26 13:57:23,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:57:23,744 INFO L220 hiAutomatonCegarLoop]: Abstraction has 227 states and 663 transitions. [2022-07-26 13:57:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 663 transitions. [2022-07-26 13:57:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 205. [2022-07-26 13:57:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 205 states have (on average 2.9609756097560975) internal successors, (607), 204 states have internal predecessors, (607), 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 13:57:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 607 transitions. [2022-07-26 13:57:23,755 INFO L242 hiAutomatonCegarLoop]: Abstraction has 205 states and 607 transitions. [2022-07-26 13:57:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-26 13:57:23,764 INFO L426 stractBuchiCegarLoop]: Abstraction has 205 states and 607 transitions. [2022-07-26 13:57:23,764 INFO L333 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-26 13:57:23,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 607 transitions. [2022-07-26 13:57:23,765 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 60 [2022-07-26 13:57:23,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:23,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:23,765 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:23,765 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:23,766 INFO L733 eck$LassoCheckResult]: Stem: 4213#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 4157#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 4159#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 4161#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 4015#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 4017#[thread1ENTRY, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} 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_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 4009#[thread1ENTRY, L111-3]don't care [439] L111-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_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, 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~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 4013#[thread2ENTRY, thread1ENTRY, L111-4]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 4135#[thread1ENTRY, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 3929#[L81, thread1ENTRY, L111-4]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 3939#[thread1ENTRY, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 4251#[L81, thread1ENTRY, L111-4]don't care [2022-07-26 13:57:23,766 INFO L735 eck$LassoCheckResult]: Loop: 4251#[L81, thread1ENTRY, L111-4]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 4247#[thread1ENTRY, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 4251#[L81, thread1ENTRY, L111-4]don't care [2022-07-26 13:57:23,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1625338375, now seen corresponding path program 2 times [2022-07-26 13:57:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:23,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49910750] [2022-07-26 13:57:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:23,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:23,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:23,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash 17806, now seen corresponding path program 3 times [2022-07-26 13:57:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:23,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061913142] [2022-07-26 13:57:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:23,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:23,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:23,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1417900524, now seen corresponding path program 3 times [2022-07-26 13:57:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:23,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764580908] [2022-07-26 13:57:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:57:23,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:57:23,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764580908] [2022-07-26 13:57:23,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764580908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-26 13:57:23,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217075728] [2022-07-26 13:57:23,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-26 13:57:23,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-26 13:57:23,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:23,908 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-26 13:57:23,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-26 13:57:23,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-26 13:57:23,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-26 13:57:23,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-26 13:57:23,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:24,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-26 13:57:24,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 106 [2022-07-26 13:57:24,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 106 [2022-07-26 13:57:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:57:24,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-26 13:57:24,450 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-26 13:57:24,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 230 [2022-07-26 13:57:24,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 222 [2022-07-26 13:57:24,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 214 [2022-07-26 13:57:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:57:24,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217075728] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-26 13:57:24,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-26 13:57:24,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 21 [2022-07-26 13:57:24,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32812462] [2022-07-26 13:57:24,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-26 13:57:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:57:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-26 13:57:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2022-07-26 13:57:24,849 INFO L87 Difference]: Start difference. First operand 205 states and 607 transitions. cyclomatic complexity: 439 Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 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 13:57:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:57:25,403 INFO L93 Difference]: Finished difference Result 549 states and 1554 transitions. [2022-07-26 13:57:25,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 1554 transitions. [2022-07-26 13:57:25,407 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 136 [2022-07-26 13:57:25,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 513 states and 1479 transitions. [2022-07-26 13:57:25,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 388 [2022-07-26 13:57:25,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 388 [2022-07-26 13:57:25,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 1479 transitions. [2022-07-26 13:57:25,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:57:25,411 INFO L220 hiAutomatonCegarLoop]: Abstraction has 513 states and 1479 transitions. [2022-07-26 13:57:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 1479 transitions. [2022-07-26 13:57:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 363. [2022-07-26 13:57:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 3.002754820936639) internal successors, (1090), 362 states have internal predecessors, (1090), 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 13:57:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 1090 transitions. [2022-07-26 13:57:25,418 INFO L242 hiAutomatonCegarLoop]: Abstraction has 363 states and 1090 transitions. [2022-07-26 13:57:25,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-26 13:57:25,419 INFO L426 stractBuchiCegarLoop]: Abstraction has 363 states and 1090 transitions. [2022-07-26 13:57:25,419 INFO L333 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-26 13:57:25,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 1090 transitions. [2022-07-26 13:57:25,421 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 84 [2022-07-26 13:57:25,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:25,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:25,421 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:25,421 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:25,422 INFO L733 eck$LassoCheckResult]: Stem: 5330#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 5272#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 5274#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 5276#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 5100#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 5102#[thread1ENTRY, L110-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 5264#[L59, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} 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_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 5096#[L59, L111-3]don't care [439] L111-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_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, 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~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 5362#[thread2ENTRY, L111-4, L59]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 5482#[L86, L111-4, L59]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 5534#[L81, L111-4, L59]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 5512#[L86, L111-4, L59]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 5018#[L81, L111-4, L59]don't care [2022-07-26 13:57:25,422 INFO L735 eck$LassoCheckResult]: Loop: 5018#[L81, L111-4, L59]don't care [491] L59-->L56: Formula: (let ((.cse0 (* v_~front~0_51 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_40))) (and (<= (+ .cse0 4 v_~queue~0.offset_40) (select |v_#length_69| v_~queue~0.base_40)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (and (<= 0 v_~front~0_51) (< v_~front~0_51 v_~n~0_28) (< v_~front~0_51 v_~back~0_77)) 1 0)) (= v_~sum~0_33 (+ v_~sum~0_34 (select (select |v_#memory_int_59| v_~queue~0.base_40) .cse1))) (= (+ v_~front~0_51 1) v_~front~0_50) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|) (= (select |v_#valid_84| v_~queue~0.base_40) 1) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse1)))) InVars {~sum~0=v_~sum~0_34, ~queue~0.offset=v_~queue~0.offset_40, #valid=|v_#valid_84|, ~back~0=v_~back~0_77, #memory_int=|v_#memory_int_59|, #length=|v_#length_69|, ~queue~0.base=v_~queue~0.base_40, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_51} OutVars{~queue~0.offset=v_~queue~0.offset_40, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_9|, ~back~0=v_~back~0_77, ~queue~0.base=v_~queue~0.base_40, ~sum~0=v_~sum~0_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_59|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|, #length=|v_#length_69|, ~n~0=v_~n~0_28, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_9|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|, ~front~0=v_~front~0_50} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem1#1, ~front~0] 5040#[L81, L111-4, L56]don't care [409] L56-->L59: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork0_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 5018#[L81, L111-4, L59]don't care [2022-07-26 13:57:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2055036549, now seen corresponding path program 1 times [2022-07-26 13:57:25,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:25,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314024115] [2022-07-26 13:57:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:25,447 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:25,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 16591, now seen corresponding path program 4 times [2022-07-26 13:57:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:25,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510493980] [2022-07-26 13:57:25,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:25,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:25,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:25,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:25,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash -794816941, now seen corresponding path program 1 times [2022-07-26 13:57:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:25,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47614221] [2022-07-26 13:57:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:25,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:25,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:25,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:27,749 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:27,749 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:27,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:27,749 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:27,749 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:27,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:27,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:27,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:27,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration8_Lasso [2022-07-26 13:57:27,749 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:27,749 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:27,752 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,754 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,756 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,757 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,761 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,762 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,763 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,765 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,767 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,770 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,772 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,774 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,775 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,781 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,783 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,785 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,786 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,788 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,789 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,790 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,792 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,793 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,794 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,796 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,797 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,799 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,801 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,802 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,804 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,805 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,806 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,808 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,810 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,813 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,815 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,817 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,818 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:27,820 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:28,757 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:28,758 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:28,760 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:28,762 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:28,764 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:28,766 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:28,768 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:29,378 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:29,379 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:29,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,380 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 13:57:29,395 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 13:57:29,396 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 13:57:29,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,435 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 13:57:29,436 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 13:57:29,436 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 13:57:29,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,461 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 13:57:29,462 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 13:57:29,463 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 13:57:29,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-26 13:57:29,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,485 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 13:57:29,488 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 13:57:29,490 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 13:57:29,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,511 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 13:57:29,511 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 13:57:29,513 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 13:57:29,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,535 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 13:57:29,536 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 13:57:29,537 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 13:57:29,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,559 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 13:57:29,561 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 13:57:29,561 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 13:57:29,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,569 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,584 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 13:57:29,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,585 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 13:57:29,586 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 13:57:29,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 13:57:29,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,610 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 13:57:29,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,611 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 13:57:29,611 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 13:57:29,613 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 13:57:29,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-26 13:57:29,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,636 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 13:57:29,636 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 13:57:29,637 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 13:57:29,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,660 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 13:57:29,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,661 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 13:57:29,662 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 13:57:29,663 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 13:57:29,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,685 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 13:57:29,685 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 13:57:29,687 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 13:57:29,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,709 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 13:57:29,709 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 13:57:29,710 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 13:57:29,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-26 13:57:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,737 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 13:57:29,740 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 13:57:29,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 13:57:29,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,778 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 13:57:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,779 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 13:57:29,779 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 13:57:29,781 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 13:57:29,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:29,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:29,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-26 13:57:29,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,804 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 13:57:29,805 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 13:57:29,806 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 13:57:29,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,829 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 13:57:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,830 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 13:57:29,831 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 13:57:29,832 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 13:57:29,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,857 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 13:57:29,858 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 13:57:29,860 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 13:57:29,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,888 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 13:57:29,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,889 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 13:57:29,889 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 13:57:29,891 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 13:57:29,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,911 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 13:57:29,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,912 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 13:57:29,915 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 13:57:29,915 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 13:57:29,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-26 13:57:29,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,937 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 13:57:29,938 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 13:57:29,939 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 13:57:29,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:29,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,962 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 13:57:29,962 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 13:57:29,964 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 13:57:29,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:29,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-26 13:57:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:29,985 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 13:57:29,986 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 13:57:29,987 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 13:57:29,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:29,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:29,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:29,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:29,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:29,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:29,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:29,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,008 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 13:57:30,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,009 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 13:57:30,015 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 13:57:30,015 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 13:57:30,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,037 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 13:57:30,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,038 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 13:57:30,038 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 13:57:30,040 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 13:57:30,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,046 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-26 13:57:30,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,073 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 13:57:30,074 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 13:57:30,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:30,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,100 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 13:57:30,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,101 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 13:57:30,101 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 13:57:30,102 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 13:57:30,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,123 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 13:57:30,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,124 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 13:57:30,125 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 13:57:30,126 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 13:57:30,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,147 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 13:57:30,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,148 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 13:57:30,149 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 13:57:30,150 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 13:57:30,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-26 13:57:30,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,183 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 13:57:30,183 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 13:57:30,185 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 13:57:30,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,205 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 13:57:30,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,206 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 13:57:30,207 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 13:57:30,208 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 13:57:30,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,240 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 13:57:30,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,241 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 13:57:30,244 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 13:57:30,248 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 13:57:30,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,252 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-26 13:57:30,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,269 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 13:57:30,269 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 13:57:30,271 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 13:57:30,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,294 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 13:57:30,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,295 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 13:57:30,296 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 13:57:30,297 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 13:57:30,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,318 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 13:57:30,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,319 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 13:57:30,319 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 13:57:30,320 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 13:57:30,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,342 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 13:57:30,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,342 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 13:57:30,343 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 13:57:30,344 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 13:57:30,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,352 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:30,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,368 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 13:57:30,369 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 13:57:30,370 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 13:57:30,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:30,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:30,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:30,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,391 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 13:57:30,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,392 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 13:57:30,393 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 13:57:30,394 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 13:57:30,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:30,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,419 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 13:57:30,419 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 13:57:30,421 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 13:57:30,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-26 13:57:30,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,446 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 13:57:30,446 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 13:57:30,448 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 13:57:30,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,482 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 13:57:30,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,483 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 13:57:30,485 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 13:57:30,485 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 13:57:30,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,507 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 13:57:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,508 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 13:57:30,509 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 13:57:30,510 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 13:57:30,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:30,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,534 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 13:57:30,535 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 13:57:30,536 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 13:57:30,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:30,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,560 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 13:57:30,560 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 13:57:30,562 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 13:57:30,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-26 13:57:30,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,587 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 13:57:30,587 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 13:57:30,588 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 13:57:30,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-26 13:57:30,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,617 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 13:57:30,617 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 13:57:30,618 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 13:57:30,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,641 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 13:57:30,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,642 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 13:57:30,643 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 13:57:30,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 13:57:30,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,674 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 13:57:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,675 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 13:57:30,675 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 13:57:30,677 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 13:57:30,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:30,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,718 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 13:57:30,733 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 13:57:30,733 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 13:57:30,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-26 13:57:30,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,757 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 13:57:30,757 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 13:57:30,759 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 13:57:30,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-26 13:57:30,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,782 INFO L229 MonitoredProcess]: Starting monitored process 77 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 13:57:30,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-26 13:57:30,784 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 13:57:30,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:30,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:30,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,808 INFO L229 MonitoredProcess]: Starting monitored process 78 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 13:57:30,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-26 13:57:30,809 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 13:57:30,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:30,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:30,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:30,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:30,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:30,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:30,833 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:30,905 INFO L443 ModelExtractionUtils]: Simplification made 53 calls to the SMT solver. [2022-07-26 13:57:30,905 INFO L444 ModelExtractionUtils]: 6 out of 43 variables were initially zero. Simplification set additionally 32 variables to zero. [2022-07-26 13:57:30,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:30,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:30,906 INFO L229 MonitoredProcess]: Starting monitored process 79 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 13:57:30,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-26 13:57:30,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:30,913 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 13:57:30,913 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:30,913 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_#in~size#1, ~front~0) = 1*ULTIMATE.start_create_fresh_int_array_#in~size#1 - 1*~front~0 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_#in~size#1 - 1*~n~0 >= 0] [2022-07-26 13:57:30,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-07-26 13:57:31,095 INFO L156 tatePredicateManager]: 54 out of 55 supporting invariants were superfluous and have been removed [2022-07-26 13:57:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:31,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-26 13:57:31,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:31,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-26 13:57:31,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:31,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:31,223 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 13:57:31,223 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-07-26 13:57:31,223 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 1090 transitions. cyclomatic complexity: 788 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 13:57:31,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 1090 transitions. cyclomatic complexity: 788. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 831 states and 2601 transitions. Complement of second has 5 states. [2022-07-26 13:57:31,278 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 13:57:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 13:57:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-07-26 13:57:31,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-26 13:57:31,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:31,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 14 letters. Loop has 2 letters. [2022-07-26 13:57:31,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:31,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 12 letters. Loop has 4 letters. [2022-07-26 13:57:31,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:31,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 831 states and 2601 transitions. [2022-07-26 13:57:31,289 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 48 [2022-07-26 13:57:31,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 831 states to 351 states and 1069 transitions. [2022-07-26 13:57:31,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 142 [2022-07-26 13:57:31,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2022-07-26 13:57:31,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 351 states and 1069 transitions. [2022-07-26 13:57:31,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:57:31,292 INFO L220 hiAutomatonCegarLoop]: Abstraction has 351 states and 1069 transitions. [2022-07-26 13:57:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states and 1069 transitions. [2022-07-26 13:57:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 232. [2022-07-26 13:57:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 3.3405172413793105) internal successors, (775), 231 states have internal predecessors, (775), 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 13:57:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 775 transitions. [2022-07-26 13:57:31,297 INFO L242 hiAutomatonCegarLoop]: Abstraction has 232 states and 775 transitions. [2022-07-26 13:57:31,297 INFO L426 stractBuchiCegarLoop]: Abstraction has 232 states and 775 transitions. [2022-07-26 13:57:31,297 INFO L333 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-26 13:57:31,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 775 transitions. [2022-07-26 13:57:31,298 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 48 [2022-07-26 13:57:31,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:31,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:31,298 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:31,298 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:31,299 INFO L733 eck$LassoCheckResult]: Stem: 7135#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 7073#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 7075#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 7077#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 7171#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 6925#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 6927#[thread1ENTRY, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} 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_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 6919#[thread1ENTRY, L111-3]don't care [439] L111-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_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, 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~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 6923#[thread2ENTRY, thread1ENTRY, L111-4]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 7043#[thread1ENTRY, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 7045#[L81, thread1ENTRY, L111-4]don't care [402] thread1ENTRY-->L59: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork0_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 6849#[L81, L111-4, L59]don't care [2022-07-26 13:57:31,299 INFO L735 eck$LassoCheckResult]: Loop: 6849#[L81, L111-4, L59]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 6967#[L86, L111-4, L59]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 6849#[L81, L111-4, L59]don't care [2022-07-26 13:57:31,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:31,299 INFO L85 PathProgramCache]: Analyzing trace with hash -464986523, now seen corresponding path program 2 times [2022-07-26 13:57:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:31,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003189381] [2022-07-26 13:57:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:31,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:31,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:31,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:31,352 INFO L85 PathProgramCache]: Analyzing trace with hash 17806, now seen corresponding path program 4 times [2022-07-26 13:57:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57118745] [2022-07-26 13:57:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:31,358 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:31,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash -175432974, now seen corresponding path program 2 times [2022-07-26 13:57:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:31,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947008717] [2022-07-26 13:57:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:31,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:31,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:33,714 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:33,715 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:33,715 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:33,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:33,715 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:33,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:33,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:33,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:33,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration9_Lasso [2022-07-26 13:57:33,715 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:33,715 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:33,719 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,725 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,727 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,739 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,740 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,761 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,762 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,763 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,764 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,766 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,767 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:33,768 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,591 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,592 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,593 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,595 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,596 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,597 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,599 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,604 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,606 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,607 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,608 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,610 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,611 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,612 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,613 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,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 13:57:34,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 13:57:34,627 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,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 13:57:34,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 13:57:34,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 13:57:34,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 13:57:34,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 13:57:34,635 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,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 13:57:34,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 13:57:34,638 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:34,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 13:57:34,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 13:57:34,642 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:35,032 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-07-26 13:57:35,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:35,441 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:35,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,442 INFO L229 MonitoredProcess]: Starting monitored process 80 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 13:57:35,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-26 13:57:35,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 13:57:35,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:35,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:35,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:35,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-26 13:57:35,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,467 INFO L229 MonitoredProcess]: Starting monitored process 81 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 13:57:35,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-26 13:57:35,469 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 13:57:35,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:35,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:35,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:35,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-26 13:57:35,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,492 INFO L229 MonitoredProcess]: Starting monitored process 82 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 13:57:35,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-26 13:57:35,493 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 13:57:35,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:35,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,519 INFO L229 MonitoredProcess]: Starting monitored process 83 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 13:57:35,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-26 13:57:35,521 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 13:57:35,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-26 13:57:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,544 INFO L229 MonitoredProcess]: Starting monitored process 84 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 13:57:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-26 13:57:35,545 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 13:57:35,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:35,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,570 INFO L229 MonitoredProcess]: Starting monitored process 85 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 13:57:35,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-26 13:57:35,572 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 13:57:35,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,578 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,578 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-26 13:57:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,595 INFO L229 MonitoredProcess]: Starting monitored process 86 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 13:57:35,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-26 13:57:35,598 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 13:57:35,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:35,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:35,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:35,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-26 13:57:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,621 INFO L229 MonitoredProcess]: Starting monitored process 87 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 13:57:35,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-26 13:57:35,622 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 13:57:35,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:35,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:35,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:35,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-07-26 13:57:35,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,645 INFO L229 MonitoredProcess]: Starting monitored process 88 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 13:57:35,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-26 13:57:35,647 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 13:57:35,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-07-26 13:57:35,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,676 INFO L229 MonitoredProcess]: Starting monitored process 89 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 13:57:35,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-26 13:57:35,677 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 13:57:35,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:35,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:35,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:35,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:35,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,700 INFO L229 MonitoredProcess]: Starting monitored process 90 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 13:57:35,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-26 13:57:35,702 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 13:57:35,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:35,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:35,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:35,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-26 13:57:35,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,723 INFO L229 MonitoredProcess]: Starting monitored process 91 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 13:57:35,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-26 13:57:35,733 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 13:57:35,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-26 13:57:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,758 INFO L229 MonitoredProcess]: Starting monitored process 92 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 13:57:35,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-26 13:57:35,760 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 13:57:35,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-26 13:57:35,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,797 INFO L229 MonitoredProcess]: Starting monitored process 93 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 13:57:35,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-26 13:57:35,799 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 13:57:35,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-26 13:57:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,827 INFO L229 MonitoredProcess]: Starting monitored process 94 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 13:57:35,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-26 13:57:35,829 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 13:57:35,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-26 13:57:35,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,853 INFO L229 MonitoredProcess]: Starting monitored process 95 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 13:57:35,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-26 13:57:35,856 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 13:57:35,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,862 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-26 13:57:35,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,874 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-26 13:57:35,874 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-26 13:57:35,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:35,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,911 INFO L229 MonitoredProcess]: Starting monitored process 96 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 13:57:35,932 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 13:57:35,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-26 13:57:35,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:35,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:35,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:35,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:35,967 INFO L229 MonitoredProcess]: Starting monitored process 97 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 13:57:35,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-26 13:57:35,969 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 13:57:35,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:35,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:35,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:35,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:35,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:35,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:35,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:36,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:36,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:36,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:36,008 INFO L229 MonitoredProcess]: Starting monitored process 98 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 13:57:36,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-26 13:57:36,010 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 13:57:36,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:36,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:36,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:36,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:36,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:36,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:36,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:36,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-26 13:57:36,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:36,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:36,057 INFO L229 MonitoredProcess]: Starting monitored process 99 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 13:57:36,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-26 13:57:36,059 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 13:57:36,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:36,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:36,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:36,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:36,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:36,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:36,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:36,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-26 13:57:36,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:36,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:36,084 INFO L229 MonitoredProcess]: Starting monitored process 100 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 13:57:36,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-26 13:57:36,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 13:57:36,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:36,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:36,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:36,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:36,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:36,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:36,108 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:36,145 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2022-07-26 13:57:36,145 INFO L444 ModelExtractionUtils]: 6 out of 43 variables were initially zero. Simplification set additionally 33 variables to zero. [2022-07-26 13:57:36,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:36,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:36,146 INFO L229 MonitoredProcess]: Starting monitored process 101 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 13:57:36,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-26 13:57:36,148 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:36,154 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-26 13:57:36,154 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:36,154 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_4) = -2*~back~0 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_4 Supporting invariants [1*~queue~0.offset >= 0] [2022-07-26 13:57:36,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-26 13:57:36,296 INFO L156 tatePredicateManager]: 48 out of 50 supporting invariants were superfluous and have been removed [2022-07-26 13:57:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:36,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-26 13:57:36,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:36,381 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-26 13:57:36,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:36,385 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 13:57:36,386 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2022-07-26 13:57:36,386 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 232 states and 775 transitions. cyclomatic complexity: 592 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13:57:36,461 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 232 states and 775 transitions. cyclomatic complexity: 592. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 702 states and 2415 transitions. Complement of second has 6 states. [2022-07-26 13:57:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-26 13:57:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 13:57:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-07-26 13:57:36,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 13:57:36,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:36,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-26 13:57:36,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:36,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-26 13:57:36,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:36,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 702 states and 2415 transitions. [2022-07-26 13:57:36,467 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 13:57:36,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 702 states to 38 states and 69 transitions. [2022-07-26 13:57:36,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-26 13:57:36,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-26 13:57:36,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 69 transitions. [2022-07-26 13:57:36,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:36,468 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 69 transitions. [2022-07-26 13:57:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 69 transitions. [2022-07-26 13:57:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-07-26 13:57:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 25 states have internal predecessors, (45), 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 13:57:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2022-07-26 13:57:36,469 INFO L242 hiAutomatonCegarLoop]: Abstraction has 26 states and 45 transitions. [2022-07-26 13:57:36,469 INFO L426 stractBuchiCegarLoop]: Abstraction has 26 states and 45 transitions. [2022-07-26 13:57:36,469 INFO L333 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-26 13:57:36,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 45 transitions. [2022-07-26 13:57:36,469 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2022-07-26 13:57:36,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:57:36,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:57:36,470 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2022-07-26 13:57:36,470 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:57:36,470 INFO L733 eck$LassoCheckResult]: Stem: 8273#[ULTIMATE.startENTRY]don't care [574] ULTIMATE.startENTRY-->L127-6: Formula: (let ((.cse0 (store |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 1)) (.cse2 (select |v_#memory_int_In_5| 1))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse2 1) 0) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= 0 |v_#NULL.base_Out_2|) (= v_~queue~0.offset_Out_2 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_2|) (= 48 (select .cse2 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (= v_~queue~0.base_Out_2 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_1|) (= (select |v_#valid_In_5| 2) 1) (= |v_#length_Out_2| (store (store (store (store |v_#length_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_#NULL.offset_Out_2| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= v_~back~0_Out_10 v_~front~0_Out_2) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~n~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_5| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (= 2 (select |v_#length_In_5| 1)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2| 0) (= (select |v_#length_In_5| 2) 26) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_1|) (= v_~sum~0_Out_2 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 0)) (< |v_#StackHeapBarrier_In_1| |v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|) (= v_~v_assert~0_Out_2 1) (= (select |v_#valid_In_5| 1) 1) (= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, #length=|v_#length_In_5|, #valid=|v_#valid_In_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_2|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_Out_2|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_Out_2|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_Out_2|, #NULL.offset=|v_#NULL.offset_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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~sum~0=v_~sum~0_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_Out_2|, #length=|v_#length_Out_2|, ~front~0=v_~front~0_Out_2, ~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ~back~0=v_~back~0_Out_10, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~v_assert~0=v_~v_assert~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_Out_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_Out_2|, #StackHeapBarrier=|v_#StackHeapBarrier_In_1|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #memory_int=|v_#memory_int_In_5|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_Out_2|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} 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, ~sum~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, ~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, 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] 8275#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 8277#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 8279#[L127-6]don't care [557] L127-6-->L127-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_121| (store |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33| (store (select |v_#memory_int_122| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33| .cse1 4) (select |v_#length_125| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41| 1)) (= (select |v_#valid_160| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) 1) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_41|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_25|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_125|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} 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] 8313#[L127-6]don't care [551] L127-6-->L110-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38| |v_ULTIMATE.start_create_fresh_int_array_~size#1_30|)) (= (select |v_#valid_148| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) 1) (= (store |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23| (store (select |v_#memory_int_110| |v_ULTIMATE.start_main_~#t1~0#1.base_23|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre10#1_21|)) |v_#memory_int_109|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (select |v_#length_117| |v_ULTIMATE.start_main_~#t1~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|) (= |v_#pthreadsForks_42| (+ |v_#pthreadsForks_43| 1)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_21|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_56) (= |v_ULTIMATE.start_main_#t~pre10#1_21| |v_#pthreadsForks_43|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_56)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, #pthreadsForks=|v_#pthreadsForks_43|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_110|, #length=|v_#length_117|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|} OutVars{~queue~0.offset=v_~queue~0.offset_56, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_38|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_23|, ~queue~0.base=v_~queue~0.base_56, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_30|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_21|, #pthreadsForks=|v_#pthreadsForks_42|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_21|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_21|, #valid=|v_#valid_148|, #memory_int=|v_#memory_int_109|, #length=|v_#length_117|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, 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] 8301#[L110-3]don't care [436] L110-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_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_4|, 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|, 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_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_10|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 8263#[thread1ENTRY, L110-4]don't care [542] L110-4-->L111-3: Formula: (and (= (select |v_#valid_130| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_21|) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_35|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_21| 4) (select |v_#length_99| |v_ULTIMATE.start_main_~#t2~0#1.base_23|)) (= |v_#pthreadsForks_34| (+ |v_#pthreadsForks_35| 1)) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t2~0#1.base_23|) |v_ULTIMATE.start_main_~#t2~0#1.offset_21| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_95|)) InVars {#pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, #memory_int=|v_#memory_int_96|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} 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_9|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_21|, #valid=|v_#valid_130|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_95|, #length=|v_#length_99|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 8265#[thread1ENTRY, L111-3]don't care [439] L111-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_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_14|, 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~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~b~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 8297#[thread2ENTRY, thread1ENTRY, L111-4]don't care [483] thread2ENTRY-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~b~0#1_17| 1) (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_13)) InVars {~v_assert~0=v_~v_assert~0_13} OutVars{~v_assert~0=v_~v_assert~0_13, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 8285#[thread1ENTRY, L86, L111-4]don't care [2022-07-26 13:57:36,470 INFO L735 eck$LassoCheckResult]: Loop: 8285#[thread1ENTRY, L86, L111-4]don't care [570] L86-->L81: Formula: (and (let ((.cse9 (* v_~back~0_In_3 4))) (let ((.cse8 (+ v_~queue~0.offset_In_3 .cse9))) (let ((.cse0 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)) (.cse1 (<= 0 .cse8)) (.cse2 (= (+ v_~back~0_In_3 1) v_~back~0_Out_6)) (.cse3 (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_In_3| 256) 0)) (.cse4 (<= (+ v_~queue~0.offset_In_3 4 .cse9) (select |v_#length_In_3| v_~queue~0.base_In_3))) (.cse5 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse8)) (.cse6 (= (select |v_#valid_In_3| v_~queue~0.base_In_3) 1)) (.cse7 (not (= 0 |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6| (ite (= .cse5 1) 1 0)) .cse6 (= |v_thread2Thread1of1ForFork1_#t~mem5#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post6#1_In_3| |v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|) .cse7) (and .cse0 .cse1 .cse2 (= |v_thread2Thread1of1ForFork1_#t~mem3#1_In_3| |v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|) .cse3 .cse4 (= (ite (= (- 1) .cse5) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread2Thread1of1ForFork1_#t~post4#1_In_3| |v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|) .cse6 .cse7))))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_In_3| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_In_3) (< v_~back~0_In_3 v_~n~0_In_1)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_In_3|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_In_3|, ~back~0=v_~back~0_In_3, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_In_3|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_In_3|} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_In_3|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_Out_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_Out_6|, ~back~0=v_~back~0_Out_6, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_6|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_In_3|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_6|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_Out_6|, #length=|v_#length_In_3|, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_Out_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem3#1, ~back~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1] 8281#[L81, thread1ENTRY, L111-4]don't care [525] L81-->L86: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~1#1_19| v_~v_assert~0_17) (= (ite (= (ite (= (mod |v_thread2Thread1of1ForFork1_~b~0#1_20| 256) 0) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~b~0#1_19|)) InVars {~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_20|} OutVars{~v_assert~0=v_~v_assert~0_17, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_19|, thread2Thread1of1ForFork1_~b~0#1=|v_thread2Thread1of1ForFork1_~b~0#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~b~0#1] 8285#[thread1ENTRY, L86, L111-4]don't care [2022-07-26 13:57:36,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:36,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1496721165, now seen corresponding path program 1 times [2022-07-26 13:57:36,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:36,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102055926] [2022-07-26 13:57:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:36,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:36,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:36,491 INFO L85 PathProgramCache]: Analyzing trace with hash 19156, now seen corresponding path program 5 times [2022-07-26 13:57:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:36,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805674015] [2022-07-26 13:57:36,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:36,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:36,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -464986400, now seen corresponding path program 4 times [2022-07-26 13:57:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:57:36,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407556923] [2022-07-26 13:57:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:57:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:57:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:36,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:57:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:57:36,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:57:38,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:38,468 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:57:38,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:57:38,468 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:57:38,468 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:57:38,468 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:57:38,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:38,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:57:38,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:57:38,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-send-receive.wvr.c_BEv2_Iteration10_Lasso [2022-07-26 13:57:38,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:57:38,468 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:57:38,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 13:57:38,480 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,483 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,493 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,496 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,503 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,505 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,506 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,509 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,511 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,513 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,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 13:57:38,517 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,519 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,529 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,531 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:38,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 13:57:38,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 13:57:39,311 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,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 13:57:39,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 13:57:39,315 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,316 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,318 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,319 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,320 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,321 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,322 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,324 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,327 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,328 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,329 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,330 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,333 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:57:39,647 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2022-07-26 13:57:39,968 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:57:39,968 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:57:39,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:39,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:39,969 INFO L229 MonitoredProcess]: Starting monitored process 102 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 13:57:39,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-26 13:57:39,971 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 13:57:39,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:39,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:39,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:39,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:39,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:39,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:39,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-26 13:57:40,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,005 INFO L229 MonitoredProcess]: Starting monitored process 103 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 13:57:40,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-26 13:57:40,007 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 13:57:40,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,030 INFO L229 MonitoredProcess]: Starting monitored process 104 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 13:57:40,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-26 13:57:40,032 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 13:57:40,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-26 13:57:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,057 INFO L229 MonitoredProcess]: Starting monitored process 105 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 13:57:40,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-26 13:57:40,059 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 13:57:40,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,082 INFO L229 MonitoredProcess]: Starting monitored process 106 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 13:57:40,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-26 13:57:40,084 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 13:57:40,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,118 INFO L229 MonitoredProcess]: Starting monitored process 107 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 13:57:40,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-26 13:57:40,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:40,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-26 13:57:40,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,144 INFO L229 MonitoredProcess]: Starting monitored process 108 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 13:57:40,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-26 13:57:40,146 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 13:57:40,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-26 13:57:40,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,168 INFO L229 MonitoredProcess]: Starting monitored process 109 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 13:57:40,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-26 13:57:40,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:40,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-07-26 13:57:40,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,195 INFO L229 MonitoredProcess]: Starting monitored process 110 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 13:57:40,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-26 13:57:40,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:40,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-26 13:57:40,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,240 INFO L229 MonitoredProcess]: Starting monitored process 111 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 13:57:40,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-26 13:57:40,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:40,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-26 13:57:40,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,266 INFO L229 MonitoredProcess]: Starting monitored process 112 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 13:57:40,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-26 13:57:40,268 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 13:57:40,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,275 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-26 13:57:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,291 INFO L229 MonitoredProcess]: Starting monitored process 113 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 13:57:40,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-26 13:57:40,293 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 13:57:40,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-26 13:57:40,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,317 INFO L229 MonitoredProcess]: Starting monitored process 114 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 13:57:40,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-26 13:57:40,318 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 13:57:40,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-26 13:57:40,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,343 INFO L229 MonitoredProcess]: Starting monitored process 115 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 13:57:40,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-26 13:57:40,344 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 13:57:40,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-26 13:57:40,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,366 INFO L229 MonitoredProcess]: Starting monitored process 116 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 13:57:40,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-26 13:57:40,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 13:57:40,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,403 INFO L229 MonitoredProcess]: Starting monitored process 117 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 13:57:40,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-26 13:57:40,405 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 13:57:40,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-07-26 13:57:40,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,441 INFO L229 MonitoredProcess]: Starting monitored process 118 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 13:57:40,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-26 13:57:40,447 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 13:57:40,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-07-26 13:57:40,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,471 INFO L229 MonitoredProcess]: Starting monitored process 119 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 13:57:40,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-26 13:57:40,473 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 13:57:40,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,496 INFO L229 MonitoredProcess]: Starting monitored process 120 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 13:57:40,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-07-26 13:57:40,497 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 13:57:40,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-07-26 13:57:40,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,522 INFO L229 MonitoredProcess]: Starting monitored process 121 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 13:57:40,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-26 13:57:40,523 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 13:57:40,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,530 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-07-26 13:57:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,546 INFO L229 MonitoredProcess]: Starting monitored process 122 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 13:57:40,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-26 13:57:40,548 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 13:57:40,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-07-26 13:57:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,571 INFO L229 MonitoredProcess]: Starting monitored process 123 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 13:57:40,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-26 13:57:40,573 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 13:57:40,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-07-26 13:57:40,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,596 INFO L229 MonitoredProcess]: Starting monitored process 124 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 13:57:40,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-26 13:57:40,597 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 13:57:40,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2022-07-26 13:57:40,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,620 INFO L229 MonitoredProcess]: Starting monitored process 125 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 13:57:40,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-26 13:57:40,622 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 13:57:40,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,629 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-26 13:57:40,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,647 INFO L229 MonitoredProcess]: Starting monitored process 126 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 13:57:40,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-26 13:57:40,649 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 13:57:40,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:57:40,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:57:40,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:57:40,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,672 INFO L229 MonitoredProcess]: Starting monitored process 127 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 13:57:40,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-26 13:57:40,675 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 13:57:40,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2022-07-26 13:57:40,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,699 INFO L229 MonitoredProcess]: Starting monitored process 128 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 13:57:40,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-26 13:57:40,703 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 13:57:40,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,726 INFO L229 MonitoredProcess]: Starting monitored process 129 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 13:57:40,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-26 13:57:40,728 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 13:57:40,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-26 13:57:40,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,752 INFO L229 MonitoredProcess]: Starting monitored process 130 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 13:57:40,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-26 13:57:40,755 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 13:57:40,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,761 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,761 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-07-26 13:57:40,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,779 INFO L229 MonitoredProcess]: Starting monitored process 131 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 13:57:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-26 13:57:40,780 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 13:57:40,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,786 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-26 13:57:40,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,789 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-26 13:57:40,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,812 INFO L229 MonitoredProcess]: Starting monitored process 132 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 13:57:40,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-26 13:57:40,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 13:57:40,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,838 INFO L229 MonitoredProcess]: Starting monitored process 133 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 13:57:40,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-26 13:57:40,840 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 13:57:40,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2022-07-26 13:57:40,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,865 INFO L229 MonitoredProcess]: Starting monitored process 134 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 13:57:40,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-26 13:57:40,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 13:57:40,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,891 INFO L229 MonitoredProcess]: Starting monitored process 135 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 13:57:40,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-26 13:57:40,893 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 13:57:40,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-07-26 13:57:40,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,918 INFO L229 MonitoredProcess]: Starting monitored process 136 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 13:57:40,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-26 13:57:40,920 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 13:57:40,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-26 13:57:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,944 INFO L229 MonitoredProcess]: Starting monitored process 137 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 13:57:40,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-26 13:57:40,946 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 13:57:40,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,954 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-07-26 13:57:40,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,970 INFO L229 MonitoredProcess]: Starting monitored process 138 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 13:57:40,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-26 13:57:40,972 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 13:57:40,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:40,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:40,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:40,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:40,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:40,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:40,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:40,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:40,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:40,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:40,996 INFO L229 MonitoredProcess]: Starting monitored process 139 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 13:57:40,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-26 13:57:40,998 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 13:57:41,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-26 13:57:41,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,023 INFO L229 MonitoredProcess]: Starting monitored process 140 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 13:57:41,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-26 13:57:41,025 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 13:57:41,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-07-26 13:57:41,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,049 INFO L229 MonitoredProcess]: Starting monitored process 141 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 13:57:41,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-26 13:57:41,051 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 13:57:41,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-07-26 13:57:41,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,075 INFO L229 MonitoredProcess]: Starting monitored process 142 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 13:57:41,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-26 13:57:41,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-26 13:57:41,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2022-07-26 13:57:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,102 INFO L229 MonitoredProcess]: Starting monitored process 143 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 13:57:41,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-07-26 13:57:41,104 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 13:57:41,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-07-26 13:57:41,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,138 INFO L229 MonitoredProcess]: Starting monitored process 144 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 13:57:41,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-07-26 13:57:41,141 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 13:57:41,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-07-26 13:57:41,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,169 INFO L229 MonitoredProcess]: Starting monitored process 145 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 13:57:41,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-07-26 13:57:41,171 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 13:57:41,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,179 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:41,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,195 INFO L229 MonitoredProcess]: Starting monitored process 146 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 13:57:41,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-07-26 13:57:41,197 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 13:57:41,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:57:41,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2022-07-26 13:57:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,221 INFO L229 MonitoredProcess]: Starting monitored process 147 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 13:57:41,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-07-26 13:57:41,223 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 13:57:41,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:57:41,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:57:41,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:57:41,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:57:41,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:57:41,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:57:41,244 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:57:41,262 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-26 13:57:41,262 INFO L444 ModelExtractionUtils]: 21 out of 43 variables were initially zero. Simplification set additionally 18 variables to zero. [2022-07-26 13:57:41,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:57:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:57:41,263 INFO L229 MonitoredProcess]: Starting monitored process 148 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 13:57:41,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-07-26 13:57:41,265 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:57:41,271 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:57:41,271 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:57:41,271 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~queue~0.offset, ~back~0, v_rep(select #length ~queue~0.base)_4) = -1*~queue~0.offset - 4*~back~0 + 1*v_rep(select #length ~queue~0.base)_4 Supporting invariants [] [2022-07-26 13:57:41,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2022-07-26 13:57:41,421 INFO L156 tatePredicateManager]: 47 out of 47 supporting invariants were superfluous and have been removed [2022-07-26 13:57:41,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:57:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:41,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:57:41,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:57:41,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-26 13:57:41,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:57:41,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 126 [2022-07-26 13:57:41,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2022-07-26 13:57:41,531 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 13:57:41,531 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 13:57:41,531 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 45 transitions. cyclomatic complexity: 26 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:41,551 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 45 transitions. cyclomatic complexity: 26. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 57 states and 114 transitions. Complement of second has 4 states. [2022-07-26 13:57:41,555 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 13:57:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:57:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-07-26 13:57:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-26 13:57:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-26 13:57:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:41,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-26 13:57:41,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:57:41,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 114 transitions. [2022-07-26 13:57:41,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:57:41,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 0 states and 0 transitions. [2022-07-26 13:57:41,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-26 13:57:41,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-26 13:57:41,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-26 13:57:41,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:57:41,557 INFO L220 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:57:41,557 INFO L242 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:57:41,557 INFO L426 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-26 13:57:41,557 INFO L333 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-26 13:57:41,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-26 13:57:41,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-26 13:57:41,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-26 13:57:41,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:57:41 BoogieIcfgContainer [2022-07-26 13:57:41,562 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:57:41,562 INFO L158 Benchmark]: Toolchain (without parser) took 30189.99ms. Allocated memory was 192.9MB in the beginning and 361.8MB in the end (delta: 168.8MB). Free memory was 141.5MB in the beginning and 173.4MB in the end (delta: -31.8MB). Peak memory consumption was 137.7MB. Max. memory is 8.0GB. [2022-07-26 13:57:41,562 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:57:41,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.50ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 166.2MB in the end (delta: -25.0MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-07-26 13:57:41,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.22ms. Allocated memory is still 192.9MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:57:41,563 INFO L158 Benchmark]: Boogie Preprocessor took 30.14ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 162.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:57:41,563 INFO L158 Benchmark]: RCFGBuilder took 467.63ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 142.1MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-07-26 13:57:41,563 INFO L158 Benchmark]: BuchiAutomizer took 29368.16ms. Allocated memory was 192.9MB in the beginning and 361.8MB in the end (delta: 168.8MB). Free memory was 142.1MB in the beginning and 173.4MB in the end (delta: -31.3MB). Peak memory consumption was 137.5MB. Max. memory is 8.0GB. [2022-07-26 13:57:41,564 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.16ms. Allocated memory is still 192.9MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 276.50ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 166.2MB in the end (delta: -25.0MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.22ms. Allocated memory is still 192.9MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.14ms. Allocated memory is still 192.9MB. Free memory was 164.1MB in the beginning and 162.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 467.63ms. Allocated memory is still 192.9MB. Free memory was 162.5MB in the beginning and 142.1MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 29368.16ms. Allocated memory was 192.9MB in the beginning and 361.8MB in the end (delta: 168.8MB). Free memory was 142.1MB in the beginning and 173.4MB in the end (delta: -31.3MB). Peak memory consumption was 137.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (5 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * front + back and consists of 3 locations. One deterministic module has affine ranking function \old(size) + -1 * front and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[arr] + -2 * back and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[queue] + -4 * back + -1 * queue and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.2s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 23.6s. Construction of modules took 0.6s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 436 StatesRemovedByMinimization, 7 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, 574 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 571 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 512 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1197 IncrementalHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 14 mSDtfsCounter, 1197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital411 mio100 ax109 hnf100 lsp87 ukn64 mio100 lsp36 div131 bol100 ite100 ukn100 eq174 hnf94 smp82 dnf200 smp74 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 2 VariablesLoop: 16 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 3.6s - 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: 3.5s, 135 PlacesBefore, 31 PlacesAfterwards, 135 TransitionsBefore, 24 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 8 FixpointIterations, 74 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 6 ConcurrentYvCompositions, 7 ChoiceCompositions, 129 TotalNumberOfCompositions, 2030 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1569, positive: 1516, positive conditional: 0, positive unconditional: 1516, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 899, positive: 883, positive conditional: 0, positive unconditional: 883, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 899, positive: 883, positive conditional: 0, positive unconditional: 883, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1569, positive: 633, positive conditional: 0, positive unconditional: 633, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 899, unknown conditional: 0, unknown unconditional: 899] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6 RESULT: Ultimate proved your program to be correct! [2022-07-26 13:57:41,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2022-07-26 13:57:41,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:41,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-26 13:57:42,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...