/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:24:44,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:24:44,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:24:44,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:24:44,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:24:44,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:24:44,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:24:44,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:24:44,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:24:44,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:24:44,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:24:44,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:24:44,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:24:44,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:24:44,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:24:44,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:24:44,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:24:44,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:24:44,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:24:44,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:24:44,544 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:24:44,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:24:44,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:24:44,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:24:44,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:24:44,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:24:44,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:24:44,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:24:44,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:24:44,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:24:44,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:24:44,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:24:44,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:24:44,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:24:44,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:24:44,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:24:44,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:24:44,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:24:44,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:24:44,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:24:44,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:24:44,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:24:44,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:24:44,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:24:44,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:24:44,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:24:44,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:24:44,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:24:44,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:24:44,635 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:24:44,635 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:24:44,636 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:24:44,637 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:24:44,637 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:24:44,637 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:24:44,637 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:24:44,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:24:44,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:24:44,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:24:44,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:24:44,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:24:44,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:24:44,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:24:44,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:24:44,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:24:44,639 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:24:44,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:24:44,640 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:24:44,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:24:44,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:24:44,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:24:44,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:24:44,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:24:44,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:24:44,645 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:24:44,645 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:24:45,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:24:45,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:24:45,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:24:45,058 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:24:45,059 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:24:45,060 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-07-22 12:24:45,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5dcac19/2313041fada74818aaae37994f5adaff/FLAGcc297851d [2022-07-22 12:24:45,855 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:24:45,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-07-22 12:24:45,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5dcac19/2313041fada74818aaae37994f5adaff/FLAGcc297851d [2022-07-22 12:24:46,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb5dcac19/2313041fada74818aaae37994f5adaff [2022-07-22 12:24:46,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:24:46,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:24:46,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:46,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:24:46,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:24:46,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7174599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46, skipping insertion in model container [2022-07-22 12:24:46,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:24:46,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:24:46,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-07-22 12:24:46,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:46,460 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:24:46,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-07-22 12:24:46,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:24:46,508 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:24:46,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46 WrapperNode [2022-07-22 12:24:46,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:24:46,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:46,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:24:46,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:24:46,518 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:24:46" (1/1) ... [2022-07-22 12:24:46,527 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:24:46" (1/1) ... [2022-07-22 12:24:46,559 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 162 [2022-07-22 12:24:46,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:24:46,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:24:46,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:24:46,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:24:46,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:24:46,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:24:46,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:24:46,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:24:46,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (1/1) ... [2022-07-22 12:24:46,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:46,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:46,648 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:24:46,659 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:24:46,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:24:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:24:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:24:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:24:46,717 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:24:46,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:24:46,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:24:46,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:24:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:24:46,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:24:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:24:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:24:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:24:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:24:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:24:46,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:24:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:24:46,723 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:24:46,876 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:24:46,879 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:24:47,213 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:24:47,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:24:47,377 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:24:47,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:47 BoogieIcfgContainer [2022-07-22 12:24:47,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:24:47,381 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:24:47,381 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:24:47,385 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:24:47,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:47,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:24:46" (1/3) ... [2022-07-22 12:24:47,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1084a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:47, skipping insertion in model container [2022-07-22 12:24:47,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:47,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:24:46" (2/3) ... [2022-07-22 12:24:47,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1084a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:24:47, skipping insertion in model container [2022-07-22 12:24:47,389 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:24:47,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:24:47" (3/3) ... [2022-07-22 12:24:47,391 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-07-22 12:24:47,499 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:24:47,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 332 flow [2022-07-22 12:24:47,622 INFO L129 PetriNetUnfolder]: 11/148 cut-off events. [2022-07-22 12:24:47,623 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:24:47,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 11/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-07-22 12:24:47,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 154 transitions, 332 flow [2022-07-22 12:24:47,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 148 transitions, 314 flow [2022-07-22 12:24:47,646 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:24:47,668 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 148 transitions, 314 flow [2022-07-22 12:24:47,673 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 148 transitions, 314 flow [2022-07-22 12:24:47,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 148 transitions, 314 flow [2022-07-22 12:24:47,753 INFO L129 PetriNetUnfolder]: 11/148 cut-off events. [2022-07-22 12:24:47,754 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:24:47,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 11/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-07-22 12:24:47,759 INFO L116 LiptonReduction]: Number of co-enabled transitions 1082 [2022-07-22 12:24:53,177 INFO L131 LiptonReduction]: Checked pairs total: 1971 [2022-07-22 12:24:53,177 INFO L133 LiptonReduction]: Total number of compositions: 145 [2022-07-22 12:24:53,210 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:24:53,211 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:24:53,211 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:24:53,211 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:24:53,211 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:24:53,211 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:24:53,211 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:24:53,212 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:24:53,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:24:53,291 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 113 [2022-07-22 12:24:53,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:53,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:53,298 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:24:53,298 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:53,298 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:24:53,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 156 states, but on-demand construction may add more states [2022-07-22 12:24:53,311 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 113 [2022-07-22 12:24:53,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:53,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:53,311 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:24:53,311 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:24:53,317 INFO L748 eck$LassoCheckResult]: Stem: 153#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63| 1)) (.cse2 (select |v_#memory_int_158| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= 0 v_~queue~0.offset_75) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (= (select |v_#valid_225| 2) 1) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_225| 1) 1) (= 2 (select |v_#length_182| 1)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_225| 0) 0) (= v_~v_assert~0_88 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (= (select |v_#length_182| 2) 23) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= (select |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (store (store (store (store |v_#length_182| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_63| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_180|) (= v_~queue~0.base_75 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= 48 (select .cse2 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= v_~n~0_84 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_223|) (= (select .cse2 1) 0) (= v_~d~0_61 0) (= v_~back~0_110 v_~front~0_90) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_63|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_158|, #length=|v_#length_182|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_63|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_72, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_39|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_180|, ~front~0=v_~front~0_90, ~queue~0.offset=v_~queue~0.offset_75, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_110, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_75, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_88, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_223|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_31|, ~d~0=v_~d~0_61, #memory_int=|v_#memory_int_158|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_84, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 156#[L126-6]don't care [2022-07-22 12:24:53,318 INFO L750 eck$LassoCheckResult]: Loop: 156#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_153| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_106|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 156#[L126-6]don't care [2022-07-22 12:24:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash 636, now seen corresponding path program 1 times [2022-07-22 12:24:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:53,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651300887] [2022-07-22 12:24:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:53,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:53,500 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:53,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:53,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2022-07-22 12:24:53,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:53,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765339424] [2022-07-22 12:24:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:53,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:53,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 20290, now seen corresponding path program 1 times [2022-07-22 12:24:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:53,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483662793] [2022-07-22 12:24:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:53,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:53,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:53,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:54,982 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:24:54,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:24:54,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:24:54,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:24:54,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:24:54,984 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:54,984 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:24:54,984 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:24:54,984 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:24:54,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:24:54,985 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:24:55,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:55,964 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:24:55,970 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:24:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:55,977 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:24:55,988 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:24:55,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:24:55,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:55,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:55,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:55,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:56,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:56,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:56,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,030 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:24:56,031 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:24:56,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:56,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,098 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:24:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,100 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:24:56,102 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:24:56,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:56,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,167 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:24:56,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,169 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:24:56,181 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:24:56,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:56,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:56,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:56,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,238 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:24:56,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,240 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:24:56,241 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:24:56,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:56,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:56,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:56,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:56,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,301 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:24:56,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,303 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:24:56,305 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:24:56,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:56,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:56,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:56,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,353 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:24:56,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,355 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:24:56,357 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:24:56,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,412 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:24:56,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,415 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:24:56,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:56,419 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:24:56,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:56,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:56,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:56,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,453 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:24:56,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,455 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:24:56,456 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:24:56,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:56,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:56,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:56,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,498 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:24:56,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,500 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:24:56,500 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:24:56,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,569 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:24:56,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,571 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:24:56,578 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:24:56,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:24:56,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:24:56,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:24:56,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,635 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:24:56,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,637 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:24:56,639 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:24:56,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:24:56,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,701 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:24:56,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,703 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:24:56,707 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:24:56,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,760 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:24:56,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,761 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:24:56,762 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:24:56,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,774 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,796 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:24:56,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,797 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:24:56,798 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:24:56,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:56,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 12:24:56,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,838 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:24:56,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:24:56,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,856 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:24:56,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,901 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:24:56,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,902 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:24:56,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:56,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:24:56,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:24:56,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:24:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:56,973 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:24:56,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:24:56,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:24:56,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:24:56,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:24:56,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:24:56,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:24:56,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:24:57,002 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:24:57,010 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:24:57,046 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-22 12:24:57,046 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:24:57,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:24:57,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:24:57,050 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:24:57,076 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:24:57,078 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:24:57,100 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:24:57,101 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:24:57,101 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:24:57,144 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:24:57,251 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:24:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:57,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:24:57,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:57,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:24:57,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:24:57,360 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:24:57,403 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:24:57,406 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 156 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:57,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 156 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 158 states and 440 transitions. Complement of second has 3 states. [2022-07-22 12:24:57,466 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:24:57,472 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:24:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:24:57,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:24:57,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:57,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:24:57,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:57,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:24:57,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:24:57,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 440 transitions. [2022-07-22 12:24:57,483 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:24:57,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 142 states and 404 transitions. [2022-07-22 12:24:57,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-07-22 12:24:57,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-22 12:24:57,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 404 transitions. [2022-07-22 12:24:57,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:57,499 INFO L220 hiAutomatonCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-22 12:24:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 404 transitions. [2022-07-22 12:24:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-22 12:24:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.8450704225352115) internal successors, (404), 141 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 404 transitions. [2022-07-22 12:24:57,548 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-22 12:24:57,548 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-22 12:24:57,548 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:24:57,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 404 transitions. [2022-07-22 12:24:57,552 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:24:57,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:57,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:57,552 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:24:57,553 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:24:57,553 INFO L748 eck$LassoCheckResult]: Stem: 1010#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63| 1)) (.cse2 (select |v_#memory_int_158| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= 0 v_~queue~0.offset_75) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (= (select |v_#valid_225| 2) 1) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_225| 1) 1) (= 2 (select |v_#length_182| 1)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_225| 0) 0) (= v_~v_assert~0_88 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (= (select |v_#length_182| 2) 23) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= (select |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (store (store (store (store |v_#length_182| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_63| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_180|) (= v_~queue~0.base_75 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= 48 (select .cse2 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= v_~n~0_84 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_223|) (= (select .cse2 1) 0) (= v_~d~0_61 0) (= v_~back~0_110 v_~front~0_90) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_63|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_158|, #length=|v_#length_182|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_63|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_72, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_39|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_180|, ~front~0=v_~front~0_90, ~queue~0.offset=v_~queue~0.offset_75, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_110, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_75, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_88, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_223|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_31|, ~d~0=v_~d~0_61, #memory_int=|v_#memory_int_158|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_84, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 936#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 738#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 740#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 962#[L108-4, L48-4]don't care [2022-07-22 12:24:57,554 INFO L750 eck$LassoCheckResult]: Loop: 962#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_19| 256) 0)) (= v_~v_assert~0_37 |v_thread1Thread1of1ForFork0_~cond~0#1_19|) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_27|)) InVars {~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_27|} OutVars{~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_27|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 960#[L108-4, L55]don't care [546] L55-->L48-4: Formula: (let ((.cse1 (* 4 v_~back~0_69))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_41))) (and (not (= (ite (and (<= 0 v_~back~0_69) (< v_~back~0_69 v_~n~0_48)) 1 0) 0)) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_21| 1) |v_thread1Thread1of1ForFork0_~w~0#1_22|) (<= (+ .cse1 4 v_~queue~0.offset_41) (select |v_#length_100| v_~queue~0.base_41)) (= (ite (= (select (select |v_#memory_int_82| v_~queue~0.base_41) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= v_~back~0_68 (+ v_~back~0_69 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0)) (= 1 (select |v_#valid_127| v_~queue~0.base_41))))) InVars {~queue~0.offset=v_~queue~0.offset_41, #valid=|v_#valid_127|, ~back~0=v_~back~0_69, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_22|, #length=|v_#length_100|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_68, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~queue~0.base=v_~queue~0.base_41, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, #valid=|v_#valid_127|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_21|, #length=|v_#length_100|, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 962#[L108-4, L48-4]don't care [2022-07-22 12:24:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash 19540963, now seen corresponding path program 1 times [2022-07-22 12:24:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:57,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227302444] [2022-07-22 12:24:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:57,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:57,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:57,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 18619, now seen corresponding path program 1 times [2022-07-22 12:24:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:57,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660153815] [2022-07-22 12:24:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:57,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:57,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1599013917, now seen corresponding path program 1 times [2022-07-22 12:24:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:57,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082441055] [2022-07-22 12:24:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:24:57,782 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:24:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:24:57,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082441055] [2022-07-22 12:24:57,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082441055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:24:57,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:24:57,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:24:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137558480] [2022-07-22 12:24:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:24:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:24:57,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:24:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:24:57,899 INFO L87 Difference]: Start difference. First operand 142 states and 404 transitions. cyclomatic complexity: 299 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:24:58,008 INFO L93 Difference]: Finished difference Result 225 states and 591 transitions. [2022-07-22 12:24:58,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 591 transitions. [2022-07-22 12:24:58,014 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:24:58,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 142 states and 403 transitions. [2022-07-22 12:24:58,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-07-22 12:24:58,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-22 12:24:58,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 403 transitions. [2022-07-22 12:24:58,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:24:58,020 INFO L220 hiAutomatonCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-22 12:24:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 403 transitions. [2022-07-22 12:24:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-22 12:24:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.8380281690140845) internal successors, (403), 141 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:24:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 403 transitions. [2022-07-22 12:24:58,033 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-22 12:24:58,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:24:58,035 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-22 12:24:58,035 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:24:58,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 403 transitions. [2022-07-22 12:24:58,037 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:24:58,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:24:58,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:24:58,037 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:24:58,038 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:24:58,039 INFO L748 eck$LassoCheckResult]: Stem: 1530#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63| 1)) (.cse2 (select |v_#memory_int_158| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= 0 v_~queue~0.offset_75) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (= (select |v_#valid_225| 2) 1) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_225| 1) 1) (= 2 (select |v_#length_182| 1)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_225| 0) 0) (= v_~v_assert~0_88 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (= (select |v_#length_182| 2) 23) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= (select |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (store (store (store (store |v_#length_182| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_63| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_180|) (= v_~queue~0.base_75 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= 48 (select .cse2 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= v_~n~0_84 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_223|) (= (select .cse2 1) 0) (= v_~d~0_61 0) (= v_~back~0_110 v_~front~0_90) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_63|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_158|, #length=|v_#length_182|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_63|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_72, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_39|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_180|, ~front~0=v_~front~0_90, ~queue~0.offset=v_~queue~0.offset_75, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_110, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_75, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_88, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_223|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_31|, ~d~0=v_~d~0_61, #memory_int=|v_#memory_int_158|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_84, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1456#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_153| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_106|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 1458#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1258#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 1260#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 1484#[L108-4, L48-4]don't care [2022-07-22 12:24:58,039 INFO L750 eck$LassoCheckResult]: Loop: 1484#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_19| 256) 0)) (= v_~v_assert~0_37 |v_thread1Thread1of1ForFork0_~cond~0#1_19|) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_27|)) InVars {~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_27|} OutVars{~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_27|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1482#[L108-4, L55]don't care [546] L55-->L48-4: Formula: (let ((.cse1 (* 4 v_~back~0_69))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_41))) (and (not (= (ite (and (<= 0 v_~back~0_69) (< v_~back~0_69 v_~n~0_48)) 1 0) 0)) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_21| 1) |v_thread1Thread1of1ForFork0_~w~0#1_22|) (<= (+ .cse1 4 v_~queue~0.offset_41) (select |v_#length_100| v_~queue~0.base_41)) (= (ite (= (select (select |v_#memory_int_82| v_~queue~0.base_41) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= v_~back~0_68 (+ v_~back~0_69 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0)) (= 1 (select |v_#valid_127| v_~queue~0.base_41))))) InVars {~queue~0.offset=v_~queue~0.offset_41, #valid=|v_#valid_127|, ~back~0=v_~back~0_69, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_22|, #length=|v_#length_100|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_68, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~queue~0.base=v_~queue~0.base_41, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, #valid=|v_#valid_127|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_21|, #length=|v_#length_100|, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 1484#[L108-4, L48-4]don't care [2022-07-22 12:24:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:58,040 INFO L85 PathProgramCache]: Analyzing trace with hash 605053277, now seen corresponding path program 1 times [2022-07-22 12:24:58,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:58,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217054440] [2022-07-22 12:24:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:58,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:58,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:58,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:58,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash 18619, now seen corresponding path program 2 times [2022-07-22 12:24:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:58,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443932069] [2022-07-22 12:24:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:58,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:58,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:24:58,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1635631895, now seen corresponding path program 1 times [2022-07-22 12:24:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:24:58,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584686600] [2022-07-22 12:24:58,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:24:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:24:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:58,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:24:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:24:58,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:24:59,594 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:25:00,265 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:00,265 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:00,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:00,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:00,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:00,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:00,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:00,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:00,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:25:00,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:00,266 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:00,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:00,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:00,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:00,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:00,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:00,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:00,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:01,822 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:01,823 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:01,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:01,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:01,828 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:25:01,831 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:25:01,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:01,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:01,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:01,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:01,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:01,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:01,840 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:01,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:01,866 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:25:01,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:01,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:01,869 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:25:01,872 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:25:01,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:01,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:01,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:01,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:01,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:01,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:01,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:01,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:01,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:01,926 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:25:01,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:01,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:01,928 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:25:01,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:01,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:01,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:01,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:01,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:01,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:01,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:01,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:01,939 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:25:01,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:01,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:25:01,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:01,963 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:25:01,965 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:25:01,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:01,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:01,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:01,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:01,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:01,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:01,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:01,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:01,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:01,997 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:25:02,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,001 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:25:02,002 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:25:02,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:02,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:02,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:02,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:02,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,038 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:25:02,039 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:25:02,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:02,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:02,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:02,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:02,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,080 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:25:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,081 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:25:02,083 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:25:02,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:02,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:02,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:02,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,151 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:25:02,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,153 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:25:02,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:02,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:02,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:02,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:02,167 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:25:02,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,211 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:25:02,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:02,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,227 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:25:02,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,233 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:25:02,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:02,252 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:25:02,258 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,285 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:25:02,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,286 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:25:02,287 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:25:02,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:02,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:02,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:02,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,322 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:25:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,323 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:25:02,324 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:25:02,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:25:02,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:02,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:02,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:02,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,366 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:25:02,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:02,373 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:25:02,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:02,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:02,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:02,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:25:02,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,408 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:25:02,409 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:25:02,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:25:02,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:02,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:02,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:02,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:02,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:02,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:02,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:02,491 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-07-22 12:25:02,491 INFO L444 ModelExtractionUtils]: 19 out of 40 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-07-22 12:25:02,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,492 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:25:02,495 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:25:02,495 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:02,502 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:25:02,502 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:02,503 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~queue~0.base)_1, ~back~0) = 1*v_rep(select #length ~queue~0.base)_1 - 2*~back~0 Supporting invariants [1*~queue~0.offset >= 0] [2022-07-22 12:25:02,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:02,691 INFO L257 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2022-07-22 12:25:02,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:02,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:25:02,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:02,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 12:25:02,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:02,796 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:25:02,796 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2022-07-22 12:25:02,797 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 403 transitions. cyclomatic complexity: 298 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:25:02,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 403 transitions. cyclomatic complexity: 298. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 396 states and 1381 transitions. Complement of second has 5 states. [2022-07-22 12:25:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:25:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:25:02,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-07-22 12:25:02,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:25:02,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:02,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:25:02,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:02,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 12:25:02,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:02,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 396 states and 1381 transitions. [2022-07-22 12:25:02,919 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 84 [2022-07-22 12:25:02,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 396 states to 300 states and 1028 transitions. [2022-07-22 12:25:02,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-07-22 12:25:02,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-22 12:25:02,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 300 states and 1028 transitions. [2022-07-22 12:25:02,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:02,928 INFO L220 hiAutomatonCegarLoop]: Abstraction has 300 states and 1028 transitions. [2022-07-22 12:25:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states and 1028 transitions. [2022-07-22 12:25:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 226. [2022-07-22 12:25:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 3.6548672566371683) internal successors, (826), 225 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 826 transitions. [2022-07-22 12:25:02,946 INFO L242 hiAutomatonCegarLoop]: Abstraction has 226 states and 826 transitions. [2022-07-22 12:25:02,946 INFO L425 stractBuchiCegarLoop]: Abstraction has 226 states and 826 transitions. [2022-07-22 12:25:02,946 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:25:02,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 826 transitions. [2022-07-22 12:25:02,949 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 84 [2022-07-22 12:25:02,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:02,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:02,950 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:02,950 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:02,951 INFO L748 eck$LassoCheckResult]: Stem: 2546#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63| 1)) (.cse2 (select |v_#memory_int_158| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= 0 v_~queue~0.offset_75) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (= (select |v_#valid_225| 2) 1) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_225| 1) 1) (= 2 (select |v_#length_182| 1)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_225| 0) 0) (= v_~v_assert~0_88 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (= (select |v_#length_182| 2) 23) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= (select |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (store (store (store (store |v_#length_182| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_63| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_180|) (= v_~queue~0.base_75 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= 48 (select .cse2 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= v_~n~0_84 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_223|) (= (select .cse2 1) 0) (= v_~d~0_61 0) (= v_~back~0_110 v_~front~0_90) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_63|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_158|, #length=|v_#length_182|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_63|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_72, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_39|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_180|, ~front~0=v_~front~0_90, ~queue~0.offset=v_~queue~0.offset_75, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_110, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_75, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_88, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_223|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_31|, ~d~0=v_~d~0_61, #memory_int=|v_#memory_int_158|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_84, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2394#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_153| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_106|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 2396#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2122#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 2124#[L108-4, thread1ENTRY]don't care [575] L108-4-->L109-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_126| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= (select |v_#valid_159| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= (store |v_#memory_int_119| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_119| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre12#1_25|)) |v_#memory_int_118|) (= |v_ULTIMATE.start_main_#t~pre12#1_25| |v_#pthreadsForks_53|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_119|, #length=|v_#length_126|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_25|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_15|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_159|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_118|, #length=|v_#length_126|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 2276#[L109-3, thread1ENTRY]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2278#[thread1ENTRY, L109-4, thread2ENTRY]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_20) InVars {~v_assert~0=v_~v_assert~0_20} OutVars{~v_assert~0=v_~v_assert~0_20, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 2320#[thread1ENTRY, L109-4, L81]don't care [2022-07-22 12:25:02,952 INFO L750 eck$LassoCheckResult]: Loop: 2320#[thread1ENTRY, L109-4, L81]don't care [522] L81-->L75: Formula: (let ((.cse1 (* v_~front~0_49 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_35))) (and (= (select |v_#valid_101| v_~queue~0.base_35) 1) (= (+ v_~front~0_49 1) v_~front~0_48) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (select (select |v_#memory_int_72| v_~queue~0.base_35) .cse0) |v_thread2Thread1of1ForFork1_~temp~0#1_17|) (<= (+ 4 .cse1 v_~queue~0.offset_35) (select |v_#length_80| v_~queue~0.base_35)) (= (ite (and (< v_~front~0_49 v_~n~0_40) (< v_~front~0_49 v_~back~0_60) (<= 0 v_~front~0_49)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse0) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_35, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_101|, ~back~0=v_~back~0_60, #memory_int=|v_#memory_int_72|, #length=|v_#length_80|, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_40, ~front~0=v_~front~0_49} OutVars{~queue~0.offset=v_~queue~0.offset_35, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_17|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_60, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_9|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_9|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_72|, #length=|v_#length_80|, ~n~0=v_~n~0_40, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 2510#[thread1ENTRY, L109-4, L75]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 2490#[thread1ENTRY, L109-4, L78]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 2320#[thread1ENTRY, L109-4, L81]don't care [2022-07-22 12:25:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1635774901, now seen corresponding path program 1 times [2022-07-22 12:25:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:02,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537278985] [2022-07-22 12:25:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:03,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 1 times [2022-07-22 12:25:03,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:03,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30825046] [2022-07-22 12:25:03,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:03,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,058 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:03,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash 671651126, now seen corresponding path program 1 times [2022-07-22 12:25:03,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:03,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217626760] [2022-07-22 12:25:03,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:03,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:03,155 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:25:03,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:03,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217626760] [2022-07-22 12:25:03,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217626760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:03,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:03,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:25:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919720533] [2022-07-22 12:25:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:03,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:25:03,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:25:03,254 INFO L87 Difference]: Start difference. First operand 226 states and 826 transitions. cyclomatic complexity: 643 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:03,314 INFO L93 Difference]: Finished difference Result 278 states and 855 transitions. [2022-07-22 12:25:03,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 855 transitions. [2022-07-22 12:25:03,318 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-22 12:25:03,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 229 states and 706 transitions. [2022-07-22 12:25:03,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-22 12:25:03,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-22 12:25:03,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 706 transitions. [2022-07-22 12:25:03,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:25:03,323 INFO L220 hiAutomatonCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-22 12:25:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 706 transitions. [2022-07-22 12:25:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-07-22 12:25:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 3.0829694323144103) internal successors, (706), 228 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 706 transitions. [2022-07-22 12:25:03,336 INFO L242 hiAutomatonCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-22 12:25:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:25:03,337 INFO L425 stractBuchiCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-22 12:25:03,337 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:25:03,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 706 transitions. [2022-07-22 12:25:03,340 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-22 12:25:03,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:03,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:03,341 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:03,341 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:25:03,342 INFO L748 eck$LassoCheckResult]: Stem: 3256#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63| 1)) (.cse2 (select |v_#memory_int_158| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= 0 v_~queue~0.offset_75) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (= (select |v_#valid_225| 2) 1) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= (select |v_#valid_225| 1) 1) (= 2 (select |v_#length_182| 1)) (= |v_#NULL.base_12| 0) (= (select |v_#valid_225| 0) 0) (= v_~v_assert~0_88 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_63|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (= (select |v_#length_182| 2) 23) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= (select |v_#valid_225| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (store (store (store (store |v_#length_182| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_63| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_180|) (= v_~queue~0.base_75 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= 48 (select .cse2 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= v_~n~0_84 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_223|) (= (select .cse2 1) 0) (= v_~d~0_61 0) (= v_~back~0_110 v_~front~0_90) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_63|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_225|, #memory_int=|v_#memory_int_158|, #length=|v_#length_182|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_63|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_72, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_39|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_180|, ~front~0=v_~front~0_90, ~queue~0.offset=v_~queue~0.offset_75, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_110, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_75, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_88, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_39|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_223|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_31|, ~d~0=v_~d~0_61, #memory_int=|v_#memory_int_158|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_84, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3088#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_153| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (= (store |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_107| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_106|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_120| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_153|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_120|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 3090#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2858#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 2860#[L108-4, thread1ENTRY]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 3224#[L108-4, L48-4]don't care [552] L48-4-->L55: Formula: (and (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_19| 256) 0)) (= v_~v_assert~0_37 |v_thread1Thread1of1ForFork0_~cond~0#1_19|) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_27|)) InVars {~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_27|} OutVars{~v_assert~0=v_~v_assert~0_37, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_27|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 3232#[L108-4, L55]don't care [546] L55-->L48-4: Formula: (let ((.cse1 (* 4 v_~back~0_69))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_41))) (and (not (= (ite (and (<= 0 v_~back~0_69) (< v_~back~0_69 v_~n~0_48)) 1 0) 0)) (<= 0 .cse0) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_21| 1) |v_thread1Thread1of1ForFork0_~w~0#1_22|) (<= (+ .cse1 4 v_~queue~0.offset_41) (select |v_#length_100| v_~queue~0.base_41)) (= (ite (= (select (select |v_#memory_int_82| v_~queue~0.base_41) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) (= v_~back~0_68 (+ v_~back~0_69 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| 0)) (= 1 (select |v_#valid_127| v_~queue~0.base_41))))) InVars {~queue~0.offset=v_~queue~0.offset_41, #valid=|v_#valid_127|, ~back~0=v_~back~0_69, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_22|, #length=|v_#length_100|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_48} OutVars{~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_68, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~queue~0.base=v_~queue~0.base_41, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_17|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, #valid=|v_#valid_127|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, #memory_int=|v_#memory_int_82|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_21|, #length=|v_#length_100|, ~n~0=v_~n~0_48} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 3126#[L108-4, L48-4]don't care [575] L108-4-->L109-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_126| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_#pthreadsForks_52| (+ |v_#pthreadsForks_53| 1)) (= (select |v_#valid_159| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (= (store |v_#memory_int_119| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_119| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre12#1_25|)) |v_#memory_int_118|) (= |v_ULTIMATE.start_main_#t~pre12#1_25| |v_#pthreadsForks_53|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|)) InVars {#pthreadsForks=|v_#pthreadsForks_53|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_119|, #length=|v_#length_126|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_25|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_15|, #pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_159|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_118|, #length=|v_#length_126|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 3238#[L48-4, L109-3]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3298#[L109-4, L48-4, thread2ENTRY]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_20) InVars {~v_assert~0=v_~v_assert~0_20} OutVars{~v_assert~0=v_~v_assert~0_20, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 3206#[L109-4, L81, L48-4]don't care [2022-07-22 12:25:03,342 INFO L750 eck$LassoCheckResult]: Loop: 3206#[L109-4, L81, L48-4]don't care [522] L81-->L75: Formula: (let ((.cse1 (* v_~front~0_49 4))) (let ((.cse0 (+ .cse1 v_~queue~0.offset_35))) (and (= (select |v_#valid_101| v_~queue~0.base_35) 1) (= (+ v_~front~0_49 1) v_~front~0_48) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (select (select |v_#memory_int_72| v_~queue~0.base_35) .cse0) |v_thread2Thread1of1ForFork1_~temp~0#1_17|) (<= (+ 4 .cse1 v_~queue~0.offset_35) (select |v_#length_80| v_~queue~0.base_35)) (= (ite (and (< v_~front~0_49 v_~n~0_40) (< v_~front~0_49 v_~back~0_60) (<= 0 v_~front~0_49)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0)) (<= 0 .cse0) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_35, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_101|, ~back~0=v_~back~0_60, #memory_int=|v_#memory_int_72|, #length=|v_#length_80|, ~queue~0.base=v_~queue~0.base_35, ~n~0=v_~n~0_40, ~front~0=v_~front~0_49} OutVars{~queue~0.offset=v_~queue~0.offset_35, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_17|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_60, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~queue~0.base=v_~queue~0.base_35, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_9|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_9|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_72|, #length=|v_#length_80|, ~n~0=v_~n~0_40, ~front~0=v_~front~0_48} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 3060#[L109-4, L48-4, L75]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 3066#[L109-4, L48-4, L78]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 3206#[L109-4, L81, L48-4]don't care [2022-07-22 12:25:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:03,342 INFO L85 PathProgramCache]: Analyzing trace with hash 706377992, now seen corresponding path program 1 times [2022-07-22 12:25:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:03,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865177965] [2022-07-22 12:25:03,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:03,456 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:25:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 2 times [2022-07-22 12:25:03,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:03,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029243360] [2022-07-22 12:25:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:03,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,542 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1632474877, now seen corresponding path program 1 times [2022-07-22 12:25:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:03,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542178306] [2022-07-22 12:25:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:03,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:06,478 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:06,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:06,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:06,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:06,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:06,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:06,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:06,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:06,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:25:06,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:06,479 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:06,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:06,955 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:109) 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:25:06,957 INFO L158 Benchmark]: Toolchain (without parser) took 20764.64ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 126.5MB in the beginning and 107.5MB in the end (delta: 19.1MB). Peak memory consumption was 127.4MB. Max. memory is 8.0GB. [2022-07-22 12:25:06,958 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:25:06,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.46ms. Allocated memory is still 151.0MB. Free memory was 126.4MB in the beginning and 115.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:25:06,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.78ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 113.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:06,959 INFO L158 Benchmark]: Boogie Preprocessor took 36.77ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 111.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:25:06,960 INFO L158 Benchmark]: RCFGBuilder took 781.38ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 129.2MB in the end (delta: -17.6MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2022-07-22 12:25:06,960 INFO L158 Benchmark]: BuchiAutomizer took 19575.71ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 129.2MB in the beginning and 107.5MB in the end (delta: 21.7MB). Peak memory consumption was 130.3MB. Max. memory is 8.0GB. [2022-07-22 12:25:06,963 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.26ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.46ms. Allocated memory is still 151.0MB. Free memory was 126.4MB in the beginning and 115.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.78ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 113.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.77ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 111.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 781.38ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 129.2MB in the end (delta: -17.6MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 19575.71ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 129.2MB in the beginning and 107.5MB in the end (delta: 21.7MB). Peak memory consumption was 130.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 147 PlacesBefore, 32 PlacesAfterwards, 148 TransitionsBefore, 25 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 7 FixpointIterations, 93 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 7 ConcurrentYvCompositions, 8 ChoiceCompositions, 145 TotalNumberOfCompositions, 1971 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1562, positive: 1489, positive conditional: 0, positive unconditional: 1489, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 820, positive: 793, positive conditional: 0, positive unconditional: 793, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 820, positive: 792, positive conditional: 0, positive unconditional: 792, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1562, positive: 696, positive conditional: 0, positive unconditional: 696, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 820, unknown conditional: 0, unknown unconditional: 820] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - 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:25:07,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...