/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:47:14,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:47:14,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:47:14,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:47:14,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:47:14,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:47:14,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:47:14,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:47:14,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:47:14,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:47:14,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:47:14,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:47:14,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:47:14,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:47:14,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:47:14,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:47:14,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:47:14,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:47:14,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:47:14,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:47:14,477 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:47:14,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:47:14,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:47:14,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:47:14,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:47:14,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:47:14,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:47:14,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:47:14,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:47:14,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:47:14,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:47:14,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:47:14,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:47:14,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:47:14,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:47:14,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:47:14,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:47:14,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:47:14,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:47:14,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:47:14,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:47:14,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:47:14,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:47:14,578 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:47:14,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:47:14,579 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:47:14,580 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:47:14,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:47:14,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:47:14,582 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:47:14,582 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:47:14,582 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:47:14,584 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:47:14,584 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:47:14,584 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:47:14,585 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:47:14,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:47:14,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:47:14,585 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:47:14,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:47:14,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:47:14,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:47:14,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:47:14,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:47:14,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:47:14,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:47:14,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:47:14,587 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:47:14,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:47:14,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:47:14,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:47:14,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:47:14,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:47:14,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:47:14,590 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:47:14,593 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:47:14,593 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:47:15,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:47:15,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:47:15,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:47:15,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:47:15,076 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:47:15,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-07-22 12:47:15,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c5cc6a0/c0dd06290bc14eae8496d2937245d233/FLAG4c9b53c07 [2022-07-22 12:47:15,875 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:47:15,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-07-22 12:47:15,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c5cc6a0/c0dd06290bc14eae8496d2937245d233/FLAG4c9b53c07 [2022-07-22 12:47:16,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c5cc6a0/c0dd06290bc14eae8496d2937245d233 [2022-07-22 12:47:16,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:47:16,240 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:47:16,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:47:16,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:47:16,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:47:16,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a017a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16, skipping insertion in model container [2022-07-22 12:47:16,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:47:16,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:47:16,477 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-channel-sum.wvr.c[2947,2960] [2022-07-22 12:47:16,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:47:16,503 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:47:16,556 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-channel-sum.wvr.c[2947,2960] [2022-07-22 12:47:16,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:47:16,578 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:47:16,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16 WrapperNode [2022-07-22 12:47:16,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:47:16,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:47:16,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:47:16,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:47:16,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,627 INFO L137 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 148 [2022-07-22 12:47:16,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:47:16,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:47:16,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:47:16,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:47:16,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:47:16,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:47:16,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:47:16,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:47:16,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (1/1) ... [2022-07-22 12:47:16,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:16,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:16,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:47:16,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:47:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:47:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:47:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:47:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:47:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:47:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:47:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:47:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:47:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:47:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:47:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:47:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:47:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:47:16,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:47:16,771 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:47:16,865 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:47:16,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:47:17,417 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:47:17,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:47:17,496 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:47:17,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:47:17 BoogieIcfgContainer [2022-07-22 12:47:17,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:47:17,500 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:47:17,500 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:47:17,506 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:47:17,507 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:47:17,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:47:16" (1/3) ... [2022-07-22 12:47:17,508 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6609ff55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:47:17, skipping insertion in model container [2022-07-22 12:47:17,509 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:47:17,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:47:16" (2/3) ... [2022-07-22 12:47:17,509 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6609ff55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:47:17, skipping insertion in model container [2022-07-22 12:47:17,509 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:47:17,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:47:17" (3/3) ... [2022-07-22 12:47:17,511 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-07-22 12:47:17,700 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:47:17,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 140 transitions, 296 flow [2022-07-22 12:47:17,859 INFO L129 PetriNetUnfolder]: 11/136 cut-off events. [2022-07-22 12:47:17,859 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:47:17,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 136 events. 11/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 126 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-07-22 12:47:17,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 140 transitions, 296 flow [2022-07-22 12:47:17,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 136 transitions, 284 flow [2022-07-22 12:47:17,886 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:47:17,902 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 136 transitions, 284 flow [2022-07-22 12:47:17,908 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 136 transitions, 284 flow [2022-07-22 12:47:17,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 284 flow [2022-07-22 12:47:17,979 INFO L129 PetriNetUnfolder]: 11/136 cut-off events. [2022-07-22 12:47:17,980 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:47:17,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 136 events. 11/136 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 129 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2022-07-22 12:47:17,985 INFO L116 LiptonReduction]: Number of co-enabled transitions 1292 [2022-07-22 12:47:23,332 INFO L131 LiptonReduction]: Checked pairs total: 1475 [2022-07-22 12:47:23,332 INFO L133 LiptonReduction]: Total number of compositions: 150 [2022-07-22 12:47:23,354 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:47:23,354 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:47:23,354 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:47:23,354 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:47:23,355 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:47:23,355 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:47:23,355 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:47:23,355 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:47:23,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:47:23,398 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 23 [2022-07-22 12:47:23,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:23,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:23,405 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:47:23,405 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:47:23,406 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:47:23,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 42 states, but on-demand construction may add more states [2022-07-22 12:47:23,414 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 23 [2022-07-22 12:47:23,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:23,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:23,415 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:47:23,415 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:47:23,421 INFO L748 eck$LassoCheckResult]: Stem: 137#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 140#[L115-6]don't care [2022-07-22 12:47:23,422 INFO L750 eck$LassoCheckResult]: Loop: 140#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 140#[L115-6]don't care [2022-07-22 12:47:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2022-07-22 12:47:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:23,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959613167] [2022-07-22 12:47:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:23,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:23,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:23,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 585, now seen corresponding path program 1 times [2022-07-22 12:47:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:23,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043836253] [2022-07-22 12:47:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:23,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:23,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:23,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash 19712, now seen corresponding path program 1 times [2022-07-22 12:47:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:23,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850429857] [2022-07-22 12:47:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:23,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:23,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:24,276 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:47:24,277 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:47:24,277 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:47:24,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:47:24,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:47:24,278 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:24,278 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:47:24,278 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:47:24,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:47:24,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:47:24,279 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:47:24,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:24,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:25,152 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:47:25,157 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:47:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:25,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:25,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:47:25,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:47:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,239 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:47:25,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:25,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:25,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:25,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:47:25,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:25,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:25,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:25,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:47:25,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:25,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:25,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:25,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:47:25,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-22 12:47:25,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:25,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:25,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:25,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,479 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:47:25,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:25,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:25,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:25,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:47:25,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:25,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:25,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:25,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:47:25,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:25,596 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:25,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,639 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:47:25,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:25,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:25,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:47:25,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:25,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:25,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,789 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:25,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:25,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:47:25,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,854 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-22 12:47:25,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,855 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:47:25,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:25,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:25,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,921 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:47:25,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,936 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:47:25,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,945 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:47:25,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:25,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:25,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:25,988 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:25,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:47:25,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:25,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:25,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:25,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:25,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:25,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:25,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:25,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:26,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:26,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:26,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:26,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:26,023 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:26,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:47:26,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:26,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:26,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:26,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:26,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:26,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:26,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:26,060 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:47:26,102 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:47:26,102 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:47:26,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:26,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:26,123 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:26,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:47:26,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:47:26,183 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:47:26,183 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:47:26,184 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:47:26,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:26,335 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:47:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:26,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:47:26,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:26,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:47:26,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:47:26,466 INFO L142 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-22 12:47:26,469 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 42 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-22 12:47:26,528 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 42 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 44 states and 96 transitions. Complement of second has 3 states. [2022-07-22 12:47:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:47:26,537 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-22 12:47:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:47:26,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:47:26,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:26,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:47:26,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:26,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:47:26,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:26,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 96 transitions. [2022-07-22 12:47:26,555 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:47:26,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 85 transitions. [2022-07-22 12:47:26,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-07-22 12:47:26,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 12:47:26,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 85 transitions. [2022-07-22 12:47:26,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:26,567 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-22 12:47:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 85 transitions. [2022-07-22 12:47:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-22 12:47:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 37 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 85 transitions. [2022-07-22 12:47:26,608 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-22 12:47:26,608 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 85 transitions. [2022-07-22 12:47:26,608 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:47:26,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 85 transitions. [2022-07-22 12:47:26,613 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:47:26,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:26,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:26,614 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:47:26,614 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:47:26,615 INFO L748 eck$LassoCheckResult]: Stem: 412#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 396#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 398#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 414#[L99-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 406#[L57, L99-4]don't care [2022-07-22 12:47:26,620 INFO L750 eck$LassoCheckResult]: Loop: 406#[L57, L99-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 408#[L53, L99-4]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 406#[L57, L99-4]don't care [2022-07-22 12:47:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash 18965758, now seen corresponding path program 1 times [2022-07-22 12:47:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:26,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287116442] [2022-07-22 12:47:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:26,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:26,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 1 times [2022-07-22 12:47:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563488893] [2022-07-22 12:47:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:26,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:26,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1046242527, now seen corresponding path program 1 times [2022-07-22 12:47:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:26,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128182846] [2022-07-22 12:47:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:47:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:47:26,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128182846] [2022-07-22 12:47:26,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128182846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:47:26,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:47:26,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:47:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485001364] [2022-07-22 12:47:26,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:47:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:47:26,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:47:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:47:26,995 INFO L87 Difference]: Start difference. First operand 38 states and 85 transitions. cyclomatic complexity: 62 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-22 12:47:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:47:27,090 INFO L93 Difference]: Finished difference Result 65 states and 130 transitions. [2022-07-22 12:47:27,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 130 transitions. [2022-07-22 12:47:27,099 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:47:27,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 38 states and 84 transitions. [2022-07-22 12:47:27,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-22 12:47:27,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 12:47:27,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 84 transitions. [2022-07-22 12:47:27,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:27,104 INFO L220 hiAutomatonCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-22 12:47:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 84 transitions. [2022-07-22 12:47:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-22 12:47:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.210526315789474) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 84 transitions. [2022-07-22 12:47:27,113 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-22 12:47:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:47:27,114 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 84 transitions. [2022-07-22 12:47:27,114 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:47:27,114 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 84 transitions. [2022-07-22 12:47:27,118 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:47:27,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:27,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:27,119 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:47:27,119 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:47:27,120 INFO L748 eck$LassoCheckResult]: Stem: 564#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 548#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 550#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 552#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 566#[L99-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 558#[L57, L99-4]don't care [2022-07-22 12:47:27,120 INFO L750 eck$LassoCheckResult]: Loop: 558#[L57, L99-4]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 560#[L53, L99-4]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 558#[L57, L99-4]don't care [2022-07-22 12:47:27,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:27,121 INFO L85 PathProgramCache]: Analyzing trace with hash 587795112, now seen corresponding path program 1 times [2022-07-22 12:47:27,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:27,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584638238] [2022-07-22 12:47:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 2 times [2022-07-22 12:47:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:27,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790087983] [2022-07-22 12:47:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:27,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2064562167, now seen corresponding path program 1 times [2022-07-22 12:47:27,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:27,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977646350] [2022-07-22 12:47:27,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:27,364 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-22 12:47:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:47:27,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977646350] [2022-07-22 12:47:27,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977646350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:47:27,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:47:27,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:47:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643074132] [2022-07-22 12:47:27,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:47:27,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:27,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:47:27,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:47:27,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:47:27,569 INFO L87 Difference]: Start difference. First operand 38 states and 84 transitions. cyclomatic complexity: 61 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:47:27,637 INFO L93 Difference]: Finished difference Result 46 states and 96 transitions. [2022-07-22 12:47:27,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 96 transitions. [2022-07-22 12:47:27,638 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-22 12:47:27,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 42 states and 88 transitions. [2022-07-22 12:47:27,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-22 12:47:27,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-22 12:47:27,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 88 transitions. [2022-07-22 12:47:27,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:27,641 INFO L220 hiAutomatonCegarLoop]: Abstraction has 42 states and 88 transitions. [2022-07-22 12:47:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 88 transitions. [2022-07-22 12:47:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-07-22 12:47:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 81 transitions. [2022-07-22 12:47:27,645 INFO L242 hiAutomatonCegarLoop]: Abstraction has 38 states and 81 transitions. [2022-07-22 12:47:27,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:47:27,647 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 81 transitions. [2022-07-22 12:47:27,647 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:47:27,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 81 transitions. [2022-07-22 12:47:27,648 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 14 [2022-07-22 12:47:27,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:27,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:27,648 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:47:27,648 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:47:27,649 INFO L748 eck$LassoCheckResult]: Stem: 695#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 675#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 677#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 679#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 697#[L99-4, thread1ENTRY]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 637#[L100-3, thread1ENTRY]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 639#[L100-4, thread2ENTRY, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 653#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 705#[L100-4, L65-4, thread1ENTRY]don't care [2022-07-22 12:47:27,650 INFO L750 eck$LassoCheckResult]: Loop: 705#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 705#[L100-4, L65-4, thread1ENTRY]don't care [2022-07-22 12:47:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 427264054, now seen corresponding path program 1 times [2022-07-22 12:47:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:27,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396675439] [2022-07-22 12:47:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,702 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times [2022-07-22 12:47:27,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:27,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074123933] [2022-07-22 12:47:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:27,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:27,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash 360284359, now seen corresponding path program 2 times [2022-07-22 12:47:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844326604] [2022-07-22 12:47:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:27,845 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-22 12:47:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:47:27,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844326604] [2022-07-22 12:47:27,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844326604] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:47:27,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031099947] [2022-07-22 12:47:27,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 12:47:27,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:47:27,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:27,847 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:47:27,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-22 12:47:27,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 12:47:27,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 12:47:27,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 12:47:27,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:28,009 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-22 12:47:28,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-07-22 12:47:28,230 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-22 12:47:28,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:47:28,617 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-22 12:47:28,618 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 315 treesize of output 267 [2022-07-22 12:47:28,631 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 267 treesize of output 259 [2022-07-22 12:47:28,977 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-22 12:47:28,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031099947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:47:28,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:47:28,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 13 [2022-07-22 12:47:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207329637] [2022-07-22 12:47:28,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:47:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:47:29,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 12:47:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-22 12:47:29,346 INFO L87 Difference]: Start difference. First operand 38 states and 81 transitions. cyclomatic complexity: 54 Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:47:29,885 INFO L93 Difference]: Finished difference Result 78 states and 157 transitions. [2022-07-22 12:47:29,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 157 transitions. [2022-07-22 12:47:29,887 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 22 [2022-07-22 12:47:29,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 64 states and 130 transitions. [2022-07-22 12:47:29,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-07-22 12:47:29,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-07-22 12:47:29,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 130 transitions. [2022-07-22 12:47:29,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:29,890 INFO L220 hiAutomatonCegarLoop]: Abstraction has 64 states and 130 transitions. [2022-07-22 12:47:29,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 130 transitions. [2022-07-22 12:47:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-07-22 12:47:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 121 transitions. [2022-07-22 12:47:29,896 INFO L242 hiAutomatonCegarLoop]: Abstraction has 58 states and 121 transitions. [2022-07-22 12:47:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:47:29,897 INFO L425 stractBuchiCegarLoop]: Abstraction has 58 states and 121 transitions. [2022-07-22 12:47:29,898 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:47:29,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 121 transitions. [2022-07-22 12:47:29,899 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 18 [2022-07-22 12:47:29,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:29,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:29,899 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:47:29,899 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:47:29,901 INFO L748 eck$LassoCheckResult]: Stem: 937#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 911#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 913#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 973#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 971#[L99-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 969#[L57, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 961#[L100-3, L57]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 893#[L100-4, L57, thread2ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 897#[L100-4, L65-4, L57]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 905#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:29,901 INFO L750 eck$LassoCheckResult]: Loop: 905#[L100-4, L65-4, L57]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 907#[L100-4, L65-4, L53]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 905#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:29,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash 229514238, now seen corresponding path program 1 times [2022-07-22 12:47:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222633893] [2022-07-22 12:47:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:29,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:29,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:29,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:29,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 3 times [2022-07-22 12:47:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:29,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98879245] [2022-07-22 12:47:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:29,979 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:29,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:29,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1519868895, now seen corresponding path program 1 times [2022-07-22 12:47:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:29,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261862441] [2022-07-22 12:47:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:30,147 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-22 12:47:30,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:47:30,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261862441] [2022-07-22 12:47:30,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261862441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:47:30,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:47:30,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:47:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481515111] [2022-07-22 12:47:30,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:47:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:47:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:47:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:47:30,301 INFO L87 Difference]: Start difference. First operand 58 states and 121 transitions. cyclomatic complexity: 76 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-22 12:47:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:47:30,382 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2022-07-22 12:47:30,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 146 transitions. [2022-07-22 12:47:30,383 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 24 [2022-07-22 12:47:30,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 62 states and 126 transitions. [2022-07-22 12:47:30,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2022-07-22 12:47:30,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2022-07-22 12:47:30,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 126 transitions. [2022-07-22 12:47:30,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:30,385 INFO L220 hiAutomatonCegarLoop]: Abstraction has 62 states and 126 transitions. [2022-07-22 12:47:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 126 transitions. [2022-07-22 12:47:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-22 12:47:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0576923076923075) internal successors, (107), 51 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 107 transitions. [2022-07-22 12:47:30,395 INFO L242 hiAutomatonCegarLoop]: Abstraction has 52 states and 107 transitions. [2022-07-22 12:47:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:47:30,399 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 107 transitions. [2022-07-22 12:47:30,399 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:47:30,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 107 transitions. [2022-07-22 12:47:30,401 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 20 [2022-07-22 12:47:30,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:30,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:30,401 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:47:30,401 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:47:30,402 INFO L748 eck$LassoCheckResult]: Stem: 1127#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1103#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1105#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1107#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1129#[L99-4, thread1ENTRY]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1063#[L100-3, thread1ENTRY]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1065#[L100-4, thread2ENTRY, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 1085#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 1143#[L100-4, L65-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1147#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:30,403 INFO L750 eck$LassoCheckResult]: Loop: 1147#[L100-4, L65-4, L57]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 1163#[L100-4, L65-4, L53]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 1147#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 360284178, now seen corresponding path program 2 times [2022-07-22 12:47:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:30,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124141562] [2022-07-22 12:47:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:30,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:30,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 4 times [2022-07-22 12:47:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:30,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5355495] [2022-07-22 12:47:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:30,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:30,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1659237645, now seen corresponding path program 2 times [2022-07-22 12:47:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:30,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057973535] [2022-07-22 12:47:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:30,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:30,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:32,578 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:47:32,579 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:47:32,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:47:32,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:47:32,579 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:47:32,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:32,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:47:32,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:47:32,580 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:47:32,580 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:47:32,580 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:47:32,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:32,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:33,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:34,523 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:47:34,523 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:47:34,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,526 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-22 12:47:34,528 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-22 12:47:34,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:34,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:34,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,566 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-22 12:47:34,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,567 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-22 12:47:34,573 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-22 12:47:34,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,611 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-22 12:47:34,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,612 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-22 12:47:34,615 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-22 12:47:34,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,647 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-22 12:47:34,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,649 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-22 12:47:34,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,669 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-22 12:47:34,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,717 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-22 12:47:34,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,720 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-22 12:47:34,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-22 12:47:34,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:34,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:34,745 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-22 12:47:34,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:34,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,790 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-22 12:47:34,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,805 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-22 12:47:34,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:47:34,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,833 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-22 12:47:34,836 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-22 12:47:34,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 12:47:34,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,866 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:47:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:47:34,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:34,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:34,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 12:47:34,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,903 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-22 12:47:34,904 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-22 12:47:34,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:34,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,936 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-22 12:47:34,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,937 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-22 12:47:34,938 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-22 12:47:34,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-22 12:47:34,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:34,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:47:34,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:34,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:34,970 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-22 12:47:34,971 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-22 12:47:34,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-22 12:47:34,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:34,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:34,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:34,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:34,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:34,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:34,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:34,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,001 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-22 12:47:35,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,003 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-22 12:47:35,004 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-22 12:47:35,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:35,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:35,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:35,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,050 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-22 12:47:35,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,052 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-22 12:47:35,052 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-22 12:47:35,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:47:35,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,105 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-22 12:47:35,106 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-22 12:47:35,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,142 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-22 12:47:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,149 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-22 12:47:35,153 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-22 12:47:35,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 12:47:35,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,190 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-22 12:47:35,191 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-22 12:47:35,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:35,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,233 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-22 12:47:35,236 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-22 12:47:35,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:35,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,282 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-22 12:47:35,283 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-22 12:47:35,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,291 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,291 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,316 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-22 12:47:35,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,318 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-22 12:47:35,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,324 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-22 12:47:35,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,356 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-22 12:47:35,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,357 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-22 12:47:35,358 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-22 12:47:35,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:35,426 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-22 12:47:35,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,427 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-22 12:47:35,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:35,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:35,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:35,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:35,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:35,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:35,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:35,456 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-22 12:47:35,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:47:35,527 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-22 12:47:35,527 INFO L444 ModelExtractionUtils]: 8 out of 43 variables were initially zero. Simplification set additionally 30 variables to zero. [2022-07-22 12:47:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:35,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:35,534 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-22 12:47:35,536 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:47:35,542 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-22 12:47:35,544 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:47:35,544 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:47:35,545 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~queue~0.base)_1, ~front~0) = 3*v_rep(select #length ~queue~0.base)_1 - 4*~front~0 Supporting invariants [-2*~back~0 + 1*v_rep(select #length ~queue~0.base)_1 >= 0] [2022-07-22 12:47:35,570 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-22 12:47:35,770 INFO L257 tatePredicateManager]: 33 out of 35 supporting invariants were superfluous and have been removed [2022-07-22 12:47:35,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:35,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:35,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 12:47:35,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:35,862 INFO L356 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2022-07-22 12:47:35,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 29 [2022-07-22 12:47:36,081 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 5 treesize of output 3 [2022-07-22 12:47:36,085 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 14 treesize of output 5 [2022-07-22 12:47:36,089 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-22 12:47:36,091 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-22 12:47:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:36,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 12:47:36,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:47:36,157 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2022-07-22 12:47:36,157 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 107 transitions. cyclomatic complexity: 70 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-22 12:47:36,417 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 107 transitions. cyclomatic complexity: 70. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 98 states and 209 transitions. Complement of second has 10 states. [2022-07-22 12:47:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2022-07-22 12:47:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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-22 12:47:36,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-07-22 12:47:36,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:47:36,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:36,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 12:47:36,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:36,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 27 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-22 12:47:36,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:36,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 209 transitions. [2022-07-22 12:47:36,426 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 18 [2022-07-22 12:47:36,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 87 states and 187 transitions. [2022-07-22 12:47:36,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-07-22 12:47:36,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2022-07-22 12:47:36,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 187 transitions. [2022-07-22 12:47:36,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:36,435 INFO L220 hiAutomatonCegarLoop]: Abstraction has 87 states and 187 transitions. [2022-07-22 12:47:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 187 transitions. [2022-07-22 12:47:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 60. [2022-07-22 12:47:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0) internal successors, (120), 59 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 120 transitions. [2022-07-22 12:47:36,443 INFO L242 hiAutomatonCegarLoop]: Abstraction has 60 states and 120 transitions. [2022-07-22 12:47:36,443 INFO L425 stractBuchiCegarLoop]: Abstraction has 60 states and 120 transitions. [2022-07-22 12:47:36,444 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:47:36,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 120 transitions. [2022-07-22 12:47:36,444 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 18 [2022-07-22 12:47:36,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:36,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:36,446 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:47:36,446 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:47:36,447 INFO L748 eck$LassoCheckResult]: Stem: 1561#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1537#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1539#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1543#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1599#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1597#[L99-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1557#[L57, L99-4]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1491#[L100-3, L57]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1493#[L100-4, L57, thread2ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 1517#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:36,447 INFO L750 eck$LassoCheckResult]: Loop: 1517#[L100-4, L65-4, L57]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 1517#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 236972745, now seen corresponding path program 1 times [2022-07-22 12:47:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:36,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240073514] [2022-07-22 12:47:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:36,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:36,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 2 times [2022-07-22 12:47:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:36,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138983087] [2022-07-22 12:47:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:36,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:36,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1243778924, now seen corresponding path program 3 times [2022-07-22 12:47:36,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:36,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33273390] [2022-07-22 12:47:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:36,532 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:36,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:38,292 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:47:38,292 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:47:38,292 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:47:38,292 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:47:38,293 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:47:38,293 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:38,293 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:47:38,293 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:47:38,293 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration7_Lasso [2022-07-22 12:47:38,293 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:47:38,293 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:47:38,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:38,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:39,740 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-07-22 12:47:40,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:47:40,190 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:47:40,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,198 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-22 12:47:40,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,206 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-22 12:47:40,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:40,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:40,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:40,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,235 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-22 12:47:40,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,247 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-22 12:47:40,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,275 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-22 12:47:40,276 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-22 12:47:40,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,311 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-22 12:47:40,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,313 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-22 12:47:40,314 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-22 12:47:40,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,381 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-22 12:47:40,382 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-22 12:47:40,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,392 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,426 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-22 12:47:40,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,427 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-22 12:47:40,430 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-22 12:47:40,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,437 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:47:40,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,440 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:47:40,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,473 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-22 12:47:40,474 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-22 12:47:40,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 12:47:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,508 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-22 12:47:40,509 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-22 12:47:40,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,544 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-22 12:47:40,545 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-22 12:47:40,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,598 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-22 12:47:40,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,613 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-22 12:47:40,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,638 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-22 12:47:40,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,639 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-22 12:47:40,648 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-22 12:47:40,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,685 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-22 12:47:40,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-22 12:47:40,687 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-22 12:47:40,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,718 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-22 12:47:40,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,719 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-22 12:47:40,720 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-22 12:47:40,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,760 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-22 12:47:40,761 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-22 12:47:40,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,773 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,795 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-22 12:47:40,796 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-22 12:47:40,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,830 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-22 12:47:40,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,831 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-22 12:47:40,832 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-22 12:47:40,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-22 12:47:40,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,840 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 12:47:40,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,853 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-22 12:47:40,853 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 12:47:40,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 12:47:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,903 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-22 12:47:40,904 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-22 12:47:40,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,937 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-22 12:47:40,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,938 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-22 12:47:40,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,945 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-22 12:47:40,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:40,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:40,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:40,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:40,976 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-22 12:47:40,977 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-22 12:47:40,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:40,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:40,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:40,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:40,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:40,992 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:40,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:41,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:47:41,034 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:47:41,034 INFO L444 ModelExtractionUtils]: 17 out of 43 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-07-22 12:47:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:41,035 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-22 12:47:41,036 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-22 12:47:41,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:47:41,044 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:47:41,044 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:47:41,044 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, ~n~0) = -1*~back~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:47:41,066 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-22 12:47:41,215 INFO L257 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2022-07-22 12:47:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:41,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:47:41,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:41,281 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 12:47:41,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:47:41,282 INFO L142 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-22 12:47:41,283 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 120 transitions. cyclomatic complexity: 77 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:41,321 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 120 transitions. cyclomatic complexity: 77. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 88 states and 179 transitions. Complement of second has 3 states. [2022-07-22 12:47:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:47:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:47:41,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:47:41,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:41,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-22 12:47:41,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:41,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:47:41,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:41,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 179 transitions. [2022-07-22 12:47:41,330 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 17 [2022-07-22 12:47:41,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 85 states and 175 transitions. [2022-07-22 12:47:41,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-07-22 12:47:41,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-22 12:47:41,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 175 transitions. [2022-07-22 12:47:41,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:41,337 INFO L220 hiAutomatonCegarLoop]: Abstraction has 85 states and 175 transitions. [2022-07-22 12:47:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 175 transitions. [2022-07-22 12:47:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-07-22 12:47:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 2.0) internal successors, (144), 71 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 144 transitions. [2022-07-22 12:47:41,349 INFO L242 hiAutomatonCegarLoop]: Abstraction has 72 states and 144 transitions. [2022-07-22 12:47:41,349 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 144 transitions. [2022-07-22 12:47:41,349 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:47:41,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 144 transitions. [2022-07-22 12:47:41,350 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 17 [2022-07-22 12:47:41,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:41,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:41,351 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:47:41,351 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:47:41,352 INFO L748 eck$LassoCheckResult]: Stem: 1963#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1925#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1927#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 1931#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 1999#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 1995#[L99-4, thread1ENTRY]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 1993#[L100-3, thread1ENTRY]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1893#[L100-4, thread2ENTRY, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 1897#[L100-4, L65-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 1915#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:41,352 INFO L750 eck$LassoCheckResult]: Loop: 1915#[L100-4, L65-4, L57]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 1915#[L100-4, L65-4, L57]don't care [2022-07-22 12:47:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash 241190955, now seen corresponding path program 2 times [2022-07-22 12:47:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:41,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360562175] [2022-07-22 12:47:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:41,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:41,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 3 times [2022-07-22 12:47:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:41,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130342655] [2022-07-22 12:47:41,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:41,397 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:41,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:41,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1113014414, now seen corresponding path program 4 times [2022-07-22 12:47:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:41,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306687685] [2022-07-22 12:47:41,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:41,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:41,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:41,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:41,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:43,347 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:47:43,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:47:43,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:47:43,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:47:43,348 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:47:43,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:43,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:47:43,348 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:47:43,348 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration8_Lasso [2022-07-22 12:47:43,348 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:47:43,348 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:47:43,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:43,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:44,867 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-07-22 12:47:45,321 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:47:45,323 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:47:45,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,324 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-22 12:47:45,325 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-22 12:47:45,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,355 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-22 12:47:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,356 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-22 12:47:45,357 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-22 12:47:45,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 12:47:45,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,387 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-22 12:47:45,388 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-22 12:47:45,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,419 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-22 12:47:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,421 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-22 12:47:45,421 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-22 12:47:45,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 12:47:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,453 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-22 12:47:45,454 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-22 12:47:45,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,490 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-22 12:47:45,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,492 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-22 12:47:45,492 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-22 12:47:45,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-22 12:47:45,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:45,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,524 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-22 12:47:45,524 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-22 12:47:45,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:45,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:45,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,558 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-22 12:47:45,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,559 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-22 12:47:45,559 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-22 12:47:45,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-22 12:47:45,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:45,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:45,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 12:47:45,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,596 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-22 12:47:45,597 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-22 12:47:45,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-22 12:47:45,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,626 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-22 12:47:45,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,627 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-22 12:47:45,628 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-22 12:47:45,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,637 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,658 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-22 12:47:45,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,659 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-22 12:47:45,659 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-22 12:47:45,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:45,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:45,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,692 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-22 12:47:45,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,693 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-22 12:47:45,694 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-22 12:47:45,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:45,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,729 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-22 12:47:45,730 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-22 12:47:45,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 12:47:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,764 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-22 12:47:45,765 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-22 12:47:45,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,798 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-22 12:47:45,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,799 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-22 12:47:45,799 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-22 12:47:45,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,831 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-22 12:47:45,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,832 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-22 12:47:45,833 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-22 12:47:45,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:45,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:45,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,865 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-22 12:47:45,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,866 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-22 12:47:45,867 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-22 12:47:45,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-22 12:47:45,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-07-22 12:47:45,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,898 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-22 12:47:45,899 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-22 12:47:45,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:45,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:45,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,933 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-22 12:47:45,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,934 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-22 12:47:45,935 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-22 12:47:45,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:45,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:45,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:45,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:45,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-22 12:47:45,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:45,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:45,968 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-22 12:47:45,971 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-22 12:47:45,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-22 12:47:45,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:45,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:45,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:45,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:45,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:45,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:45,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:45,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,002 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-22 12:47:46,004 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-22 12:47:46,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:46,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:46,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:46,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,034 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-22 12:47:46,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,035 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-22 12:47:46,036 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-22 12:47:46,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-22 12:47:46,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,042 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:46,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:46,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:46,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-22 12:47:46,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,067 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-22 12:47:46,067 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-22 12:47:46,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:46,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:46,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:46,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,099 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-22 12:47:46,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,100 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-22 12:47:46,101 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-22 12:47:46,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:46,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 12:47:46,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,137 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-22 12:47:46,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,139 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-22 12:47:46,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:47:46,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:47:46,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:47:46,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:46,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,177 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-22 12:47:46,178 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-22 12:47:46,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,187 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:47:46,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,189 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:47:46,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,200 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,220 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-22 12:47:46,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,222 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-22 12:47:46,223 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-22 12:47:46,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-22 12:47:46,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:46,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,256 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-22 12:47:46,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,257 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-22 12:47:46,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,258 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-22 12:47:46,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:46,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,291 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-22 12:47:46,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,292 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-22 12:47:46,293 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-22 12:47:46,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-22 12:47:46,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:46,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-22 12:47:46,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,326 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-22 12:47:46,327 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-22 12:47:46,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:46,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,345 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,366 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-22 12:47:46,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,368 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-22 12:47:46,369 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-22 12:47:46,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:46,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:47:46,406 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-22 12:47:46,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,407 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-22 12:47:46,408 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-22 12:47:46,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:47:46,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:47:46,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:47:46,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:47:46,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:47:46,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:47:46,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:47:46,438 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:47:46,498 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2022-07-22 12:47:46,498 INFO L444 ModelExtractionUtils]: 8 out of 43 variables were initially zero. Simplification set additionally 32 variables to zero. [2022-07-22 12:47:46,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:47:46,504 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-22 12:47:46,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:47:46,508 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-22 12:47:46,513 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:47:46,513 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:47:46,513 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, ~n~0) = -1*~back~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:47:46,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:46,691 INFO L257 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2022-07-22 12:47:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:46,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:47:46,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:47:46,740 WARN L261 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 12:47:46,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:47:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:47:46,741 INFO L142 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-22 12:47:46,742 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 144 transitions. cyclomatic complexity: 95 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:46,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 144 transitions. cyclomatic complexity: 95. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 105 states and 224 transitions. Complement of second has 3 states. [2022-07-22 12:47:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:47:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 12 transitions. [2022-07-22 12:47:46,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:47:46,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:46,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 10 letters. Loop has 1 letters. [2022-07-22 12:47:46,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:46,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:47:46,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:47:46,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 224 transitions. [2022-07-22 12:47:46,785 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 16 [2022-07-22 12:47:46,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 224 transitions. [2022-07-22 12:47:46,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2022-07-22 12:47:46,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2022-07-22 12:47:46,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 224 transitions. [2022-07-22 12:47:46,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:47:46,788 INFO L220 hiAutomatonCegarLoop]: Abstraction has 105 states and 224 transitions. [2022-07-22 12:47:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 224 transitions. [2022-07-22 12:47:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2022-07-22 12:47:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 76 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:47:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 164 transitions. [2022-07-22 12:47:46,794 INFO L242 hiAutomatonCegarLoop]: Abstraction has 77 states and 164 transitions. [2022-07-22 12:47:46,794 INFO L425 stractBuchiCegarLoop]: Abstraction has 77 states and 164 transitions. [2022-07-22 12:47:46,794 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:47:46,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 164 transitions. [2022-07-22 12:47:46,795 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 16 [2022-07-22 12:47:46,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:47:46,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:47:46,795 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:47:46,795 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:47:46,796 INFO L748 eck$LassoCheckResult]: Stem: 2396#[ULTIMATE.startENTRY]don't care [587] ULTIMATE.startENTRY-->L115-6: Formula: (let ((.cse2 (store |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (select |v_#memory_int_In_5| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_2| 0) (= (select .cse0 1) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 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_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= (select |v_#length_In_7| 2) 25) (= 0 |v_#NULL.base_Out_2|) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= v_~element~0_Out_6 0) (= v_~queue~0.offset_Out_2 0) (= 48 (select .cse0 0)) (= v_~queue~0.base_Out_2 0) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| 1) |v_#valid_Out_10|) (= (select |v_#valid_In_7| 0) 0) (= |v_#NULL.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2| |v_#StackHeapBarrier_In_3|) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select |v_#valid_In_7| 2) 1) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= (select |v_#valid_In_7| 1) 1) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_2|) (= v_~back~0_Out_6 v_~front~0_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 .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (= 2 (select |v_#length_In_7| 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_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_2|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0))))) InVars {#memory_int=|v_#memory_int_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_7|, #valid=|v_#valid_In_7|} 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_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_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_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_Out_6|, 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_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_Out_2|, ~sum~0=v_~sum~0_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_10|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_Out_2|, #length=|v_#length_Out_6|, ~front~0=v_~front~0_Out_2, ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_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_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_Out_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ~back~0=v_~back~0_Out_6, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ~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_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~element~0=v_~element~0_Out_6, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_Out_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_5|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ~sum~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #length, ~front~0, ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~ret10#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, 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_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~element~0, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2360#[L115-6]don't care [554] L115-6-->L115-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|))) (and (<= 0 .cse0) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|) (= (store |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21| (store (select |v_#memory_int_89| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|)) |v_#memory_int_88|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_38|) (= (select |v_#valid_138| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|) 1) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21| 4) (select |v_#length_111| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_29|, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet19#1_13|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_89|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_21|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_28|, #valid=|v_#valid_138|, ULTIMATE.start_create_fresh_int_array_#t~post18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post18#1_13|, #memory_int=|v_#memory_int_88|, #length=|v_#length_111|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_38|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~nondet19#1, ULTIMATE.start_create_fresh_int_array_#t~post18#1, #memory_int] 2362#[L115-6]don't care [563] L115-6-->L99-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre11#1_27| |v_#pthreadsForks_32|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| v_~queue~0.base_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (= (select |v_#valid_144| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre11#1_27|))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_115| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| v_~queue~0.offset_48) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_95|, #length=|v_#length_115|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{ULTIMATE.start_main_#t~ret10#1.base=|v_ULTIMATE.start_main_#t~ret10#1.base_23|, ~queue~0.offset=v_~queue~0.offset_48, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_27|, ULTIMATE.start_main_#t~ret10#1.offset=|v_ULTIMATE.start_main_#t~ret10#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~queue~0.base=v_~queue~0.base_48, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_18|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_18|, #pthreadsForks=|v_#pthreadsForks_31|, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_94|, #length=|v_#length_115|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret10#1.base, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~ret10#1.offset, #pthreadsForks, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 2364#[L99-3]don't care [435] L99-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 2398#[L99-4, thread1ENTRY]don't care [537] L99-4-->L100-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre13#1_17| |v_#pthreadsForks_24|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_85| |v_ULTIMATE.start_main_~#t2~0#1.base_25|)) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= (store |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25| (store (select |v_#memory_int_73| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre13#1_17|)) |v_#memory_int_72|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_104| |v_ULTIMATE.start_main_~#t2~0#1.base_25|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_73|, #length=|v_#length_85|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_17|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_72|, #length=|v_#length_85|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ULTIMATE.start_main_#t~pre11#1, #memory_int, ULTIMATE.start_main_#t~nondet12#1] 2306#[L100-3, thread1ENTRY]don't care [432] L100-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_12|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_8|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_10|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_8|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 2308#[L100-4, thread2ENTRY, thread1ENTRY]don't care [414] thread2ENTRY-->L65-4: Formula: (= |v_thread2Thread1of1ForFork0_~flag~0#1_1| 1) InVars {} OutVars{thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~flag~0#1] 2324#[L100-4, L65-4, thread1ENTRY]don't care [573] L65-4-->L65-4: Formula: (let ((.cse11 (* v_~back~0_In_1 4))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork0_~flag~0#1_In_1| 256) 0)) (.cse12 (+ .cse11 v_~queue~0.offset_In_3))) (let ((.cse0 (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|)) (.cse1 (<= 0 .cse12)) (.cse3 (select (select |v_#memory_int_In_3| v_~queue~0.base_In_3) .cse12)) (.cse4 (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2| 0))) (.cse5 (= (+ v_~back~0_In_1 1) v_~back~0_Out_2)) (.cse6 (= (select |v_#valid_In_5| v_~queue~0.base_In_3) 1)) (.cse7 (not (= (mod |v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3| 256) 0))) (.cse8 (<= (+ .cse11 v_~queue~0.offset_In_3 4) (select |v_#length_In_5| v_~queue~0.base_In_3))) (.cse9 (= (ite (= (ite .cse2 1 0) 0) 0 1) |v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|)) (.cse10 (not (= (ite (and (<= 0 v_~back~0_In_1) (< v_~back~0_In_1 v_~n~0_In_3)) 1 0) 0)))) (or (and .cse0 .cse1 (not .cse2) (= |v_thread2Thread1of1ForFork0_#t~post7#1_In_1| |v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|) (= (ite (= .cse3 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) .cse4 (= |v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2| |v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse1 (= (ite (= (- 1) .cse3) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|) (= |v_thread2Thread1of1ForFork0_#t~mem4#1_In_1| |v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|) .cse4 .cse5 (= |v_thread2Thread1of1ForFork0_#t~post5#1_Out_2| |v_thread2Thread1of1ForFork0_#t~post5#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10))))) InVars {~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_In_1|, ~back~0=v_~back~0_In_1, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_In_1|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_In_1|, thread2Thread1of1ForFork0_#t~nondet3#1=|v_thread2Thread1of1ForFork0_#t~nondet3#1_In_3|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_In_1|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_In_1|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} OutVars{~queue~0.offset=v_~queue~0.offset_In_3, thread2Thread1of1ForFork0_~flag~0#1=|v_thread2Thread1of1ForFork0_~flag~0#1_Out_2|, ~back~0=v_~back~0_Out_2, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_Out_2|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_Out_2|, ~queue~0.base=v_~queue~0.base_In_3, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_2|, thread2Thread1of1ForFork0_#t~post5#1=|v_thread2Thread1of1ForFork0_#t~post5#1_Out_2|, thread2Thread1of1ForFork0_#t~mem4#1=|v_thread2Thread1of1ForFork0_#t~mem4#1_Out_2|, #valid=|v_#valid_In_5|, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_5|, ~n~0=v_~n~0_In_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post5#1, thread2Thread1of1ForFork0_~flag~0#1, thread2Thread1of1ForFork0_#t~mem4#1, ~back~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~nondet3#1] 2410#[L100-4, L65-4, thread1ENTRY]don't care [392] thread1ENTRY-->L57: Formula: (= (ite (= (ite (< v_~front~0_1 v_~back~0_1) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_1|) InVars {~back~0=v_~back~0_1, ~front~0=v_~front~0_1} OutVars{~back~0=v_~back~0_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_1|, ~front~0=v_~front~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~cond~0#1] 2386#[L100-4, L65-4, L57]don't care [534] L100-4-->L101-1: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_23|) (= (select (select |v_#memory_int_70| |v_ULTIMATE.start_main_~#t1~0#1.base_27|) |v_ULTIMATE.start_main_~#t1~0#1.offset_23|) |v_ULTIMATE.start_main_#t~mem15#1_14|) (= (select |v_#valid_102| |v_ULTIMATE.start_main_~#t1~0#1.base_27|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_23|) (select |v_#length_83| |v_ULTIMATE.start_main_~#t1~0#1.base_27|))) InVars {#valid=|v_#valid_102|, #memory_int=|v_#memory_int_70|, #length=|v_#length_83|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_23|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_15|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_14|, #valid=|v_#valid_102|, #memory_int=|v_#memory_int_70|, #length=|v_#length_83|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_23|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet14#1] 2350#[L101-1, L65-4, L57]don't care [2022-07-22 12:47:46,797 INFO L750 eck$LassoCheckResult]: Loop: 2350#[L101-1, L65-4, L57]don't care [572] L57-->L53: Formula: (let ((.cse0 (* v_~front~0_In_1 4))) (let ((.cse1 (+ v_~queue~0.offset_In_1 .cse0))) (and (<= (+ v_~queue~0.offset_In_1 .cse0 4) (select |v_#length_In_3| v_~queue~0.base_In_1)) (not (= 0 (mod |v_thread1Thread1of1ForFork1_~cond~0#1_In_3| 256))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select (select |v_#memory_int_In_1| v_~queue~0.base_In_1) .cse1) v_~element~0_Out_2) (= (select |v_#valid_In_3| v_~queue~0.base_In_1) 1) (<= 0 .cse1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (< v_~front~0_In_1 v_~n~0_In_1) (<= 0 v_~front~0_In_1)) 1 0))))) InVars {~queue~0.offset=v_~queue~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ~queue~0.base=v_~queue~0.base_In_1, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_In_1, ~queue~0.base=v_~queue~0.base_In_1, ~element~0=v_~element~0_Out_2, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_1, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_In_3|, ~front~0=v_~front~0_In_1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[~element~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 2352#[L101-1, L65-4, L53]don't care [541] L53-->L57: Formula: (and (= v_~sum~0_17 (+ v_~element~0_14 v_~sum~0_18)) (= (ite (= (ite (< v_~front~0_40 v_~back~0_82) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_21|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~sum~0=v_~sum~0_18, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, ~front~0=v_~front~0_41} OutVars{~sum~0=v_~sum~0_17, thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_15|, ~element~0=v_~element~0_14, ~back~0=v_~back~0_82, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_21|, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~cond~0#1, ~front~0] 2350#[L101-1, L65-4, L57]don't care [2022-07-22 12:47:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1716091836, now seen corresponding path program 1 times [2022-07-22 12:47:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:46,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582395782] [2022-07-22 12:47:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:46,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:46,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash 19234, now seen corresponding path program 5 times [2022-07-22 12:47:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:46,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028970341] [2022-07-22 12:47:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:46,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 12:47:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:46,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:46,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:47:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 103205541, now seen corresponding path program 1 times [2022-07-22 12:47:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:47:46,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376264738] [2022-07-22 12:47:46,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:47:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:47:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:46,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:47:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:47:46,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:47:48,355 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:47:48,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:47:48,355 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:47:48,355 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:47:48,355 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:47:48,355 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:47:48,355 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:47:48,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:47:48,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-channel-sum.wvr.c_BEv2_Iteration9_Lasso [2022-07-22 12:47:48,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:47:48,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:47:48,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:48,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:48,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:48,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:47:49,301 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:47:49,307 INFO L158 Benchmark]: Toolchain (without parser) took 33070.14ms. Allocated memory was 151.0MB in the beginning and 357.6MB in the end (delta: 206.6MB). Free memory was 126.1MB in the beginning and 315.4MB in the end (delta: -189.3MB). Peak memory consumption was 213.9MB. Max. memory is 8.0GB. [2022-07-22 12:47:49,307 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:47:49,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.60ms. Allocated memory is still 151.0MB. Free memory was 125.9MB in the beginning and 115.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:47:49,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.98ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 112.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:47:49,309 INFO L158 Benchmark]: Boogie Preprocessor took 33.28ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:47:49,309 INFO L158 Benchmark]: RCFGBuilder took 836.15ms. Allocated memory is still 151.0MB. Free memory was 111.4MB in the beginning and 125.6MB in the end (delta: -14.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-07-22 12:47:49,310 INFO L158 Benchmark]: BuchiAutomizer took 31806.21ms. Allocated memory was 151.0MB in the beginning and 357.6MB in the end (delta: 206.6MB). Free memory was 125.1MB in the beginning and 315.4MB in the end (delta: -190.3MB). Peak memory consumption was 211.8MB. Max. memory is 8.0GB. [2022-07-22 12:47:49,311 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 336.60ms. Allocated memory is still 151.0MB. Free memory was 125.9MB in the beginning and 115.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.98ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 112.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.28ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 836.15ms. Allocated memory is still 151.0MB. Free memory was 111.4MB in the beginning and 125.6MB in the end (delta: -14.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 31806.21ms. Allocated memory was 151.0MB in the beginning and 357.6MB in the end (delta: 206.6MB). Free memory was 125.1MB in the beginning and 315.4MB in the end (delta: -190.3MB). Peak memory consumption was 211.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 132 PlacesBefore, 22 PlacesAfterwards, 136 TransitionsBefore, 18 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 8 FixpointIterations, 80 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 11 ConcurrentYvCompositions, 8 ChoiceCompositions, 150 TotalNumberOfCompositions, 1475 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1369, positive: 1343, positive conditional: 0, positive unconditional: 1343, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 746, positive: 736, positive conditional: 0, positive unconditional: 736, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1369, positive: 607, positive conditional: 0, positive unconditional: 607, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 746, unknown conditional: 0, unknown unconditional: 746] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:47:49,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-22 12:47:49,527 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...