/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-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:24:59,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:25:00,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:25:00,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:25:00,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:25:00,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:25:00,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:25:00,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:25:00,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:25:00,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:25:00,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:25:00,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:25:00,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:25:00,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:25:00,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:25:00,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:25:00,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:25:00,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:25:00,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:25:00,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:25:00,076 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:25:00,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:25:00,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:25:00,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:25:00,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:25:00,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:25:00,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:25:00,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:25:00,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:25:00,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:25:00,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:25:00,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:25:00,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:25:00,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:25:00,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:25:00,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:25:00,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:25:00,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:25:00,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:25:00,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:25:00,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:25:00,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:25:00,098 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:25:00,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:25:00,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:25:00,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:25:00,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:25:00,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:25:00,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:25:00,130 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:25:00,130 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:25:00,130 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:25:00,131 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:25:00,131 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:25:00,131 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:25:00,131 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:25:00,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:25:00,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:25:00,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:25:00,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:25:00,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:25:00,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:25:00,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:25:00,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:25:00,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:25:00,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:25:00,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:25:00,134 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:25:00,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:25:00,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:25:00,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:25:00,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:25:00,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:25:00,136 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:25:00,137 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:25:00,137 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:25:00,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:25:00,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:25:00,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:25:00,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:25:00,598 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:25:00,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-07-22 12:25:00,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed628bcc2/9cfa43775b7047069ab0781c5d58f65a/FLAGfefc43f1d [2022-07-22 12:25:01,255 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:25:01,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2022-07-22 12:25:01,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed628bcc2/9cfa43775b7047069ab0781c5d58f65a/FLAGfefc43f1d [2022-07-22 12:25:01,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed628bcc2/9cfa43775b7047069ab0781c5d58f65a [2022-07-22 12:25:01,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:25:01,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:25:01,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:01,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:25:01,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:25:01,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@742324a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01, skipping insertion in model container [2022-07-22 12:25:01,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:25:01,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:25:01,855 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-queue-add-2.wvr.c[2696,2709] [2022-07-22 12:25:01,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:01,871 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:25:01,895 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-queue-add-2.wvr.c[2696,2709] [2022-07-22 12:25:01,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:01,916 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:25:01,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01 WrapperNode [2022-07-22 12:25:01,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:01,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:01,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:25:01,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:25:01,927 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:25:01" (1/1) ... [2022-07-22 12:25:01,937 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:25:01" (1/1) ... [2022-07-22 12:25:01,967 INFO L137 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2022-07-22 12:25:01,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:01,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:25:01,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:25:01,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:25:01,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:01,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:02,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:25:02,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:25:02,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:25:02,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:25:02,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (1/1) ... [2022-07-22 12:25:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:02,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:02,060 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:25:02,072 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:25:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:25:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:25:02,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:25:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:25:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:25:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:25:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:25:02,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:25:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:25:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:25:02,134 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:25:02,228 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:25:02,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:25:02,744 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:25:02,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:25:02,909 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:25:02,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:02 BoogieIcfgContainer [2022-07-22 12:25:02,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:25:02,917 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:25:02,917 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:25:02,923 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:25:02,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:02,924 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:25:01" (1/3) ... [2022-07-22 12:25:02,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fdc1a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:02, skipping insertion in model container [2022-07-22 12:25:02,926 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:02,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:01" (2/3) ... [2022-07-22 12:25:02,926 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fdc1a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:02, skipping insertion in model container [2022-07-22 12:25:02,927 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:02,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:02" (3/3) ... [2022-07-22 12:25:02,928 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2022-07-22 12:25:03,098 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:25:03,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 133 transitions, 282 flow [2022-07-22 12:25:03,247 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2022-07-22 12:25:03,248 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:25:03,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2022-07-22 12:25:03,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 133 transitions, 282 flow [2022-07-22 12:25:03,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 129 transitions, 270 flow [2022-07-22 12:25:03,274 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:25:03,295 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 129 transitions, 270 flow [2022-07-22 12:25:03,299 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 129 transitions, 270 flow [2022-07-22 12:25:03,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 270 flow [2022-07-22 12:25:03,361 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2022-07-22 12:25:03,361 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:25:03,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2022-07-22 12:25:03,365 INFO L116 LiptonReduction]: Number of co-enabled transitions 538 [2022-07-22 12:25:08,605 INFO L131 LiptonReduction]: Checked pairs total: 668 [2022-07-22 12:25:08,606 INFO L133 LiptonReduction]: Total number of compositions: 137 [2022-07-22 12:25:08,630 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:25:08,630 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:25:08,630 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:25:08,631 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:25:08,631 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:25:08,631 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:25:08,631 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:25:08,631 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:25:08,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:25:08,669 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:25:08,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:08,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:08,675 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:08,675 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:08,675 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:25:08,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 34 states, but on-demand construction may add more states [2022-07-22 12:25:08,680 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:25:08,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:08,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:08,680 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:25:08,680 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:08,685 INFO L748 eck$LassoCheckResult]: Stem: 130#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 133#[L108-6]don't care [2022-07-22 12:25:08,685 INFO L750 eck$LassoCheckResult]: Loop: 133#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, 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_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, 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_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 133#[L108-6]don't care [2022-07-22 12:25:08,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:08,692 INFO L85 PathProgramCache]: Analyzing trace with hash 629, now seen corresponding path program 1 times [2022-07-22 12:25:08,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:08,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837885985] [2022-07-22 12:25:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:08,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:08,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash 613, now seen corresponding path program 1 times [2022-07-22 12:25:08,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:08,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338619464] [2022-07-22 12:25:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:08,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:08,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:08,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash 20081, now seen corresponding path program 1 times [2022-07-22 12:25:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:08,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275521099] [2022-07-22 12:25:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:08,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:08,969 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:09,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:09,585 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:09,586 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:09,586 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:09,586 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:09,587 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:09,587 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:09,587 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:09,587 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:09,587 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:25:09,587 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:09,588 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:09,626 INFO L141 MapEliminator]: 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:09,633 INFO L141 MapEliminator]: 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:09,634 INFO L141 MapEliminator]: 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:09,637 INFO L141 MapEliminator]: 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:09,639 INFO L141 MapEliminator]: 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:09,643 INFO L141 MapEliminator]: 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:09,644 INFO L141 MapEliminator]: 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:09,647 INFO L141 MapEliminator]: 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:09,964 INFO L141 MapEliminator]: 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:09,968 INFO L141 MapEliminator]: 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:09,971 INFO L141 MapEliminator]: 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:09,973 INFO L141 MapEliminator]: 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:09,975 INFO L141 MapEliminator]: 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:09,976 INFO L141 MapEliminator]: 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:09,979 INFO L141 MapEliminator]: 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:09,983 INFO L141 MapEliminator]: 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:09,985 INFO L141 MapEliminator]: 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:09,986 INFO L141 MapEliminator]: 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:09,988 INFO L141 MapEliminator]: 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:09,990 INFO L141 MapEliminator]: 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:09,991 INFO L141 MapEliminator]: 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:09,995 INFO L141 MapEliminator]: 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:09,998 INFO L141 MapEliminator]: 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:10,002 INFO L141 MapEliminator]: 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:10,004 INFO L141 MapEliminator]: 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:10,005 INFO L141 MapEliminator]: 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:10,006 INFO L141 MapEliminator]: 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:10,008 INFO L141 MapEliminator]: 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:10,009 INFO L141 MapEliminator]: 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:10,011 INFO L141 MapEliminator]: 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:10,012 INFO L141 MapEliminator]: 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:10,013 INFO L141 MapEliminator]: 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:10,434 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:10,439 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:10,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,443 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:25:10,455 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:25:10,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:10,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:10,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:10,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:25:10,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,522 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:25:10,525 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:25:10,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:10,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:10,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:10,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:10,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,572 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:25:10,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,575 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:25:10,576 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:25:10,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:10,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:10,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:10,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-22 12:25:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,629 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:25:10,633 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:25:10,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:10,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:10,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:10,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:10,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,693 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:25:10,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,695 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:25:10,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:10,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:10,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:10,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:10,714 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:25:10,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,761 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:25:10,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,763 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:25:10,765 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:25:10,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:10,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:10,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:10,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:10,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,826 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:25:10,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,828 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:25:10,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:10,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:10,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:10,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:10,845 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:25:10,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,892 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:25:10,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,894 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:25:10,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:10,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:10,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:10,921 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:25:10,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:10,966 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:25:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:10,968 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:25:10,971 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:25:10,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:10,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:10,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:10,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:10,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:10,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:10,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:10,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:10,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,026 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:25:11,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,028 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:25:11,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,052 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:25:11,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,096 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:25:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,097 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:25:11,125 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:25:11,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:11,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,188 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:25:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,190 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:25:11,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,214 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:25:11,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,257 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:25:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,259 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:25:11,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:11,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:11,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:11,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:11,280 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:25:11,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,326 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:25:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,328 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:25:11,330 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:25:11,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,393 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:25:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,394 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:25:11,396 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:25:11,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:11,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,452 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:25:11,454 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:25:11,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:11,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,526 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:25:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,528 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:25:11,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:11,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,552 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:25:11,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,594 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:25:11,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,596 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:25:11,607 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:25:11,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,665 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:25:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,667 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:25:11,669 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:25:11,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 12:25:11,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,734 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:11,736 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:11,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,798 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:11,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,799 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:11,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,815 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:11,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:11,867 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:11,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,868 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:11,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:11,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:11,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:11,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:11,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:11,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:11,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:11,896 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:11,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:11,945 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:25:11,945 INFO L444 ModelExtractionUtils]: 12 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-22 12:25:11,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:11,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:11,949 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:11,951 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:11,960 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:11,987 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:11,987 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:11,988 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2022-07-22 12:25:12,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:12,087 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:25:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:12,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:12,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:12,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:25:12,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:12,166 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:12,200 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:25:12,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 34 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:25:12,273 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 34 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 36 states and 77 transitions. Complement of second has 3 states. [2022-07-22 12:25:12,283 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:25:12,291 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:25:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:25:12,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:25:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:12,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:25:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:12,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:25:12,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:12,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 77 transitions. [2022-07-22 12:25:12,305 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:25:12,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 66 transitions. [2022-07-22 12:25:12,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-22 12:25:12,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 12:25:12,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 66 transitions. [2022-07-22 12:25:12,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:12,326 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:25:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 66 transitions. [2022-07-22 12:25:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 12:25:12,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 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:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. [2022-07-22 12:25:12,363 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:25:12,363 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:25:12,363 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:25:12,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 66 transitions. [2022-07-22 12:25:12,366 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:25:12,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:12,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:12,367 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:25:12,367 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:12,367 INFO L748 eck$LassoCheckResult]: Stem: 365#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 367#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |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|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (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_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |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|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{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~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #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~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 349#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, 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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 337#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 339#[L92-4, L47-4]don't care [2022-07-22 12:25:12,368 INFO L750 eck$LassoCheckResult]: Loop: 339#[L92-4, L47-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 339#[L92-4, L47-4]don't care [2022-07-22 12:25:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 19325864, now seen corresponding path program 1 times [2022-07-22 12:25:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:12,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112644307] [2022-07-22 12:25:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,405 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:12,435 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 1 times [2022-07-22 12:25:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:12,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794774908] [2022-07-22 12:25:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:12,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:12,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:12,460 INFO L85 PathProgramCache]: Analyzing trace with hash 599102345, now seen corresponding path program 1 times [2022-07-22 12:25:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:12,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240234011] [2022-07-22 12:25:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:12,594 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:12,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:12,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240234011] [2022-07-22 12:25:12,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240234011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:12,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:12,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:25:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434559454] [2022-07-22 12:25:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:12,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:25:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:25:12,714 INFO L87 Difference]: Start difference. First operand 30 states and 66 transitions. cyclomatic complexity: 51 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:12,778 INFO L93 Difference]: Finished difference Result 43 states and 85 transitions. [2022-07-22 12:25:12,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 85 transitions. [2022-07-22 12:25:12,782 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:25:12,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 65 transitions. [2022-07-22 12:25:12,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-22 12:25:12,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 12:25:12,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 65 transitions. [2022-07-22 12:25:12,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:12,784 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:25:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 65 transitions. [2022-07-22 12:25:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 12:25:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 65 transitions. [2022-07-22 12:25:12,789 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:25:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:25:12,790 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:25:12,791 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:25:12,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 65 transitions. [2022-07-22 12:25:12,792 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:25:12,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:12,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:12,793 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:25:12,793 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:12,794 INFO L748 eck$LassoCheckResult]: Stem: 481#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 483#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, 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_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, 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_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 487#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |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|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (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_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |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|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{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~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #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~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 463#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, 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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 451#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 453#[L92-4, L47-4]don't care [2022-07-22 12:25:12,794 INFO L750 eck$LassoCheckResult]: Loop: 453#[L92-4, L47-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 453#[L92-4, L47-4]don't care [2022-07-22 12:25:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash 598820396, now seen corresponding path program 1 times [2022-07-22 12:25:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:12,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065808849] [2022-07-22 12:25:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:12,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:12,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:12,885 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 2 times [2022-07-22 12:25:12,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:12,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855982871] [2022-07-22 12:25:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:12,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:12,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1383563653, now seen corresponding path program 1 times [2022-07-22 12:25:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:12,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363024967] [2022-07-22 12:25:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:13,011 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:13,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:13,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:14,512 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:14,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:14,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:14,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:14,513 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:14,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:14,513 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:14,513 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:14,513 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:25:14,513 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:14,514 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:14,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:25:15,174 INFO L141 MapEliminator]: 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:15,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,180 INFO L141 MapEliminator]: 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:15,182 INFO L141 MapEliminator]: 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:15,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,186 INFO L141 MapEliminator]: 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:15,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,192 INFO L141 MapEliminator]: 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:15,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,196 INFO L141 MapEliminator]: 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:15,197 INFO L141 MapEliminator]: 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:15,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,207 INFO L141 MapEliminator]: 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:15,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,212 INFO L141 MapEliminator]: 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:15,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,215 INFO L141 MapEliminator]: 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:15,218 INFO L141 MapEliminator]: 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:15,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,221 INFO L141 MapEliminator]: 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:15,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:15,229 INFO L141 MapEliminator]: 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:15,231 INFO L141 MapEliminator]: 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:15,232 INFO L141 MapEliminator]: 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:15,234 INFO L141 MapEliminator]: 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:15,237 INFO L141 MapEliminator]: 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:15,239 INFO L141 MapEliminator]: 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:15,240 INFO L141 MapEliminator]: 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:15,242 INFO L141 MapEliminator]: 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:15,244 INFO L141 MapEliminator]: 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:15,246 INFO L141 MapEliminator]: 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:15,873 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:15,873 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:15,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,874 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:15,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:15,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,893 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:15,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:15,938 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:15,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:15,939 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:15,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:15,949 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:15,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:15,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:15,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:15,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:15,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:15,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:15,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:16,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:16,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:16,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:16,003 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:16,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:16,013 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:16,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:16,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:16,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:16,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:16,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:16,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:16,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:16,066 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:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:16,068 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:16,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:16,076 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:16,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:16,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:16,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:16,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:16,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:16,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:16,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:16,124 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:16,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:16,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:16,126 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:16,129 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:16,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:16,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:16,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:16,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:16,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:16,139 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:16,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:16,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:16,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:16,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:16,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:16,195 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:16,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:16,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:16,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:16,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:16,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:16,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:16,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:16,226 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:16,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:16,272 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-07-22 12:25:16,272 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-07-22 12:25:16,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:16,274 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:16,274 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:16,275 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:16,282 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:16,283 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:16,283 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_back~0, ~n~0) = -1*~q_back~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:25:16,307 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:16,417 INFO L257 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2022-07-22 12:25:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:16,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:16,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:16,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:16,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:16,479 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:16,480 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:25:16,480 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 65 transitions. cyclomatic complexity: 50 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:25:16,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 65 transitions. cyclomatic complexity: 50. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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) Result 64 states and 156 transitions. Complement of second has 3 states. [2022-07-22 12:25:16,556 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:25:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:25:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 13 transitions. [2022-07-22 12:25:16,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:25:16,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:16,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:25:16,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:16,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 13 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:25:16,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:16,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 156 transitions. [2022-07-22 12:25:16,570 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:25:16,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 61 states and 151 transitions. [2022-07-22 12:25:16,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-22 12:25:16,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-07-22 12:25:16,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 151 transitions. [2022-07-22 12:25:16,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:16,581 INFO L220 hiAutomatonCegarLoop]: Abstraction has 61 states and 151 transitions. [2022-07-22 12:25:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 151 transitions. [2022-07-22 12:25:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-07-22 12:25:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.5476190476190474) internal successors, (107), 41 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 107 transitions. [2022-07-22 12:25:16,592 INFO L242 hiAutomatonCegarLoop]: Abstraction has 42 states and 107 transitions. [2022-07-22 12:25:16,592 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 107 transitions. [2022-07-22 12:25:16,594 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:25:16,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 107 transitions. [2022-07-22 12:25:16,596 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2022-07-22 12:25:16,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:16,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:16,596 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:25:16,597 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:16,599 INFO L748 eck$LassoCheckResult]: Stem: 751#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 753#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, 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_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, 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_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 763#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |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|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (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_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |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|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{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~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #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~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 723#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, 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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 709#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 711#[L92-4, L47-4]don't care [571] L92-4-->L93-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_ULTIMATE.start_main_#t~pre14#1_27| |v_#pthreadsForks_52|) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_27|)) |v_#memory_int_130|) (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_131|, #length=|v_#length_133|, 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_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, #length=|v_#length_133|, 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~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 743#[L93-3, L47-4]don't care [2022-07-22 12:25:16,599 INFO L750 eck$LassoCheckResult]: Loop: 743#[L93-3, L47-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 743#[L93-3, L47-4]don't care [2022-07-22 12:25:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1383563663, now seen corresponding path program 1 times [2022-07-22 12:25:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:16,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780778259] [2022-07-22 12:25:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 3 times [2022-07-22 12:25:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:16,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595727489] [2022-07-22 12:25:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash -59198846, now seen corresponding path program 1 times [2022-07-22 12:25:16,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:16,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659292] [2022-07-22 12:25:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:16,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:18,171 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:18,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:18,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:18,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:18,172 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:18,172 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:18,172 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:18,172 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:18,172 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 12:25:18,172 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:18,172 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:18,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:18,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:25:18,878 INFO L141 MapEliminator]: 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:18,880 INFO L141 MapEliminator]: 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:18,884 INFO L141 MapEliminator]: 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:18,886 INFO L141 MapEliminator]: 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:18,887 INFO L141 MapEliminator]: 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:18,893 INFO L141 MapEliminator]: 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:18,894 INFO L141 MapEliminator]: 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:18,898 INFO L141 MapEliminator]: 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:18,899 INFO L141 MapEliminator]: 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:18,903 INFO L141 MapEliminator]: 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:18,904 INFO L141 MapEliminator]: 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:18,906 INFO L141 MapEliminator]: 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:18,908 INFO L141 MapEliminator]: 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:18,909 INFO L141 MapEliminator]: 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:18,911 INFO L141 MapEliminator]: 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:18,912 INFO L141 MapEliminator]: 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:18,914 INFO L141 MapEliminator]: 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:18,918 INFO L141 MapEliminator]: 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:18,920 INFO L141 MapEliminator]: 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:18,921 INFO L141 MapEliminator]: 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:18,922 INFO L141 MapEliminator]: 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:18,924 INFO L141 MapEliminator]: 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:18,925 INFO L141 MapEliminator]: 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:18,927 INFO L141 MapEliminator]: 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:18,929 INFO L141 MapEliminator]: 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:18,930 INFO L141 MapEliminator]: 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:18,932 INFO L141 MapEliminator]: 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:18,933 INFO L141 MapEliminator]: 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:18,935 INFO L141 MapEliminator]: 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:18,936 INFO L141 MapEliminator]: 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:18,938 INFO L141 MapEliminator]: 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:18,939 INFO L141 MapEliminator]: 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:19,528 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:19,529 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:19,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,531 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:19,532 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:19,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:19,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:19,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:19,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:19,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:19,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,565 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:19,566 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:19,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:19,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,580 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,604 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:19,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,605 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:19,607 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:19,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:19,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 12:25:19,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,642 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:25:19,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:19,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:19,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,700 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:19,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:25:19,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,716 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 12:25:19,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,739 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:19,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:25:19,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,752 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:25:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,807 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:25:19,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:19,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 12:25:19,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,845 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:19,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:25:19,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:19,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,889 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:25:19,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:25:19,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:19,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,925 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:25:19,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:19,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:19,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:19,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 12:25:19,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:19,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:19,970 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:19,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:25:19,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:19,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:19,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:19,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:19,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:19,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:19,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:20,007 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:20,049 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-22 12:25:20,049 INFO L444 ModelExtractionUtils]: 14 out of 43 variables were initially zero. Simplification set additionally 26 variables to zero. [2022-07-22 12:25:20,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:20,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:20,052 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:20,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:25:20,054 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:20,062 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:20,062 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:20,062 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_back~0, ~n~0) = -1*~q_back~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:25:20,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 12:25:20,191 INFO L257 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2022-07-22 12:25:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:20,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:25:20,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:20,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:25:20,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:20,249 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:20,250 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:25:20,250 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 107 transitions. cyclomatic complexity: 86 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:20,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 107 transitions. cyclomatic complexity: 86. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 118 transitions. Complement of second has 3 states. [2022-07-22 12:25:20,295 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:25:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:25:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 10 transitions. [2022-07-22 12:25:20,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2022-07-22 12:25:20,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:20,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:25:20,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:20,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-22 12:25:20,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:20,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 118 transitions. [2022-07-22 12:25:20,303 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:25:20,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 118 transitions. [2022-07-22 12:25:20,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-22 12:25:20,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-22 12:25:20,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 118 transitions. [2022-07-22 12:25:20,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:20,310 INFO L220 hiAutomatonCegarLoop]: Abstraction has 47 states and 118 transitions. [2022-07-22 12:25:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 118 transitions. [2022-07-22 12:25:20,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-07-22 12:25:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 40 states have internal predecessors, (104), 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:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 104 transitions. [2022-07-22 12:25:20,319 INFO L242 hiAutomatonCegarLoop]: Abstraction has 41 states and 104 transitions. [2022-07-22 12:25:20,319 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 104 transitions. [2022-07-22 12:25:20,319 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:25:20,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 104 transitions. [2022-07-22 12:25:20,323 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2022-07-22 12:25:20,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:20,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:20,324 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:20,324 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:20,325 INFO L748 eck$LassoCheckResult]: Stem: 1031#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1033#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, 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_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, 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_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 1047#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |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|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (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_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |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|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{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~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #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~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1007#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, 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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 993#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 995#[L92-4, L47-4]don't care [571] L92-4-->L93-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_ULTIMATE.start_main_#t~pre14#1_27| |v_#pthreadsForks_52|) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_27|)) |v_#memory_int_130|) (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_131|, #length=|v_#length_133|, 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_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, #length=|v_#length_133|, 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~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 1027#[L93-3, L47-4]don't care [459] L93-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_12|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, 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_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 999#[thread2ENTRY, L93-4, L47-4]don't care [2022-07-22 12:25:20,325 INFO L750 eck$LassoCheckResult]: Loop: 999#[thread2ENTRY, L93-4, L47-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 999#[thread2ENTRY, L93-4, L47-4]don't care [2022-07-22 12:25:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash -59198948, now seen corresponding path program 1 times [2022-07-22 12:25:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:20,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858668745] [2022-07-22 12:25:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:20,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:20,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:20,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:20,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 4 times [2022-07-22 12:25:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:20,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496152141] [2022-07-22 12:25:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:20,451 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:20,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:20,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1835166827, now seen corresponding path program 1 times [2022-07-22 12:25:20,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:20,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249170962] [2022-07-22 12:25:20,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:20,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:20,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:20,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:20,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:22,178 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:22,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:22,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:22,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:22,179 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:22,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:22,179 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:22,179 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:22,179 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:25:22,180 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:22,180 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:22,184 INFO L141 MapEliminator]: 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:22,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:22,947 INFO L141 MapEliminator]: 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:22,948 INFO L141 MapEliminator]: 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:22,951 INFO L141 MapEliminator]: 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:22,953 INFO L141 MapEliminator]: 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:22,956 INFO L141 MapEliminator]: 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:22,958 INFO L141 MapEliminator]: 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:22,968 INFO L141 MapEliminator]: 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:22,971 INFO L141 MapEliminator]: 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:22,972 INFO L141 MapEliminator]: 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:22,977 INFO L141 MapEliminator]: 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:22,978 INFO L141 MapEliminator]: 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:22,980 INFO L141 MapEliminator]: 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:22,982 INFO L141 MapEliminator]: 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:22,984 INFO L141 MapEliminator]: 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:22,985 INFO L141 MapEliminator]: 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:22,987 INFO L141 MapEliminator]: 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:22,988 INFO L141 MapEliminator]: 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:22,990 INFO L141 MapEliminator]: 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:22,991 INFO L141 MapEliminator]: 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:22,993 INFO L141 MapEliminator]: 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:22,995 INFO L141 MapEliminator]: 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:22,997 INFO L141 MapEliminator]: 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:22,999 INFO L141 MapEliminator]: 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:23,001 INFO L141 MapEliminator]: 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:23,003 INFO L141 MapEliminator]: 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:23,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:25:23,023 INFO L141 MapEliminator]: 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:23,025 INFO L141 MapEliminator]: 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:23,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:25:23,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:25:23,032 INFO L141 MapEliminator]: 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:23,033 INFO L141 MapEliminator]: 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:23,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:23,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:23,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:23,045 INFO L141 MapEliminator]: 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:23,047 INFO L141 MapEliminator]: 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:23,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:23,049 INFO L141 MapEliminator]: 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:23,051 INFO L141 MapEliminator]: 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:23,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:23,668 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:25:23,668 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:25:23,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:23,669 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:23,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:25:23,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:23,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:25:23,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:23,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:23,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:23,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:25:23,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:25:23,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:25:23,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 12:25:23,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:23,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:23,703 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:23,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:25:23,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:25:23,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:25:23,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:25:23,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:25:23,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:25:23,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:25:23,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:25:23,763 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:25:23,763 INFO L444 ModelExtractionUtils]: 13 out of 43 variables were initially zero. Simplification set additionally 26 variables to zero. [2022-07-22 12:25:23,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:23,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:23,764 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:25:23,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:25:23,770 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:25:23,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:25:23,778 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:25:23,778 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~q_back~0, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_4, ~q~0.offset) = -2*~q_back~0 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_4 - 1*~q~0.offset Supporting invariants [] [2022-07-22 12:25:23,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:23,925 INFO L257 tatePredicateManager]: 28 out of 29 supporting invariants were superfluous and have been removed [2022-07-22 12:25:23,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:23,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 12:25:23,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:24,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 12:25:24,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:24,001 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:24,002 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2022-07-22 12:25:24,002 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 104 transitions. cyclomatic complexity: 83 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:24,042 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 104 transitions. cyclomatic complexity: 83. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 49 states and 128 transitions. Complement of second has 4 states. [2022-07-22 12:25:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:25:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-07-22 12:25:24,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:25:24,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:24,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:25:24,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:24,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:25:24,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:25:24,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 128 transitions. [2022-07-22 12:25:24,045 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:25:24,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 128 transitions. [2022-07-22 12:25:24,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-22 12:25:24,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-07-22 12:25:24,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 128 transitions. [2022-07-22 12:25:24,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:24,048 INFO L220 hiAutomatonCegarLoop]: Abstraction has 49 states and 128 transitions. [2022-07-22 12:25:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 128 transitions. [2022-07-22 12:25:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-07-22 12:25:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 39 states have internal predecessors, (100), 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:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 100 transitions. [2022-07-22 12:25:24,052 INFO L242 hiAutomatonCegarLoop]: Abstraction has 40 states and 100 transitions. [2022-07-22 12:25:24,052 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 100 transitions. [2022-07-22 12:25:24,053 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:25:24,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 100 transitions. [2022-07-22 12:25:24,053 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:25:24,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:24,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:24,054 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:24,054 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:24,055 INFO L748 eck$LassoCheckResult]: Stem: 1327#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1329#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, 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_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, 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_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 1339#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |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|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (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_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |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|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{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~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #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~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1301#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, 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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 1287#[thread1ENTRY, L92-4]don't care [571] L92-4-->L93-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_ULTIMATE.start_main_#t~pre14#1_27| |v_#pthreadsForks_52|) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_27|)) |v_#memory_int_130|) (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_131|, #length=|v_#length_133|, 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_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, #length=|v_#length_133|, 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~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 1291#[thread1ENTRY, L93-3]don't care [459] L93-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_12|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, 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_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1311#[thread2ENTRY, L93-4, thread1ENTRY]don't care [444] thread2ENTRY-->L65-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1] 1315#[L93-4, L65-2, thread1ENTRY]don't care [2022-07-22 12:25:24,055 INFO L750 eck$LassoCheckResult]: Loop: 1315#[L93-4, L65-2, thread1ENTRY]don't care [557] L65-2-->L65-2: Formula: (let ((.cse0 (* v_~q_front~0_73 4))) (let ((.cse1 (+ v_~q~0.offset_68 .cse0))) (and (<= (+ v_~q~0.offset_68 .cse0 4) (select |v_#length_105| v_~q~0.base_68)) (= (ite (and (< v_~q_front~0_73 v_~n~0_73) (< v_~q_front~0_73 v_~q_back~0_128) (<= 0 v_~q_front~0_73)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_30 |v_thread2Thread1of1ForFork1_~j~0#1_29|) v_~s~0_29) (= (select |v_#valid_126| v_~q~0.base_68) 1) (= (select (select |v_#memory_int_100| v_~q~0.base_68) .cse1) |v_thread2Thread1of1ForFork1_~j~0#1_29|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_29| 0)) (<= 0 .cse1) (= (+ v_~q_front~0_73 1) v_~q_front~0_72)))) InVars {~q_back~0=v_~q_back~0_128, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_73, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_30, ~q_front~0=v_~q_front~0_73} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_29|, ~q_back~0=v_~q_back~0_128, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_17|, ~q~0.base=v_~q~0.base_68, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_17|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~n~0=v_~n~0_73, ~s~0=v_~s~0_29, ~q_front~0=v_~q_front~0_72} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] 1315#[L93-4, L65-2, thread1ENTRY]don't care [2022-07-22 12:25:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash -59069817, now seen corresponding path program 1 times [2022-07-22 12:25:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712415691] [2022-07-22 12:25:24,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,074 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2022-07-22 12:25:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714899903] [2022-07-22 12:25:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1831163770, now seen corresponding path program 1 times [2022-07-22 12:25:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943428470] [2022-07-22 12:25:24,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:24,141 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:24,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943428470] [2022-07-22 12:25:24,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943428470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:25:24,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:25:24,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-22 12:25:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781214343] [2022-07-22 12:25:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:25:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:24,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:25:24,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:25:24,238 INFO L87 Difference]: Start difference. First operand 40 states and 100 transitions. cyclomatic complexity: 79 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:24,274 INFO L93 Difference]: Finished difference Result 44 states and 110 transitions. [2022-07-22 12:25:24,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 110 transitions. [2022-07-22 12:25:24,276 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:25:24,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 110 transitions. [2022-07-22 12:25:24,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-22 12:25:24,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-22 12:25:24,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 110 transitions. [2022-07-22 12:25:24,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:24,278 INFO L220 hiAutomatonCegarLoop]: Abstraction has 44 states and 110 transitions. [2022-07-22 12:25:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 110 transitions. [2022-07-22 12:25:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-22 12:25:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.5) internal successors, (110), 43 states have internal predecessors, (110), 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:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 110 transitions. [2022-07-22 12:25:24,282 INFO L242 hiAutomatonCegarLoop]: Abstraction has 44 states and 110 transitions. [2022-07-22 12:25:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:25:24,283 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 110 transitions. [2022-07-22 12:25:24,283 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:25:24,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 110 transitions. [2022-07-22 12:25:24,284 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2022-07-22 12:25:24,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:24,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:24,285 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:24,285 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:24,286 INFO L748 eck$LassoCheckResult]: Stem: 1459#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1461#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, 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_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, 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_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 1471#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |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|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (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_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |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|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{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~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #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~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1433#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, 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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 1417#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 1419#[L92-4, L47-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 1473#[L92-4, L47-4]don't care [571] L92-4-->L93-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_ULTIMATE.start_main_#t~pre14#1_27| |v_#pthreadsForks_52|) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_27|)) |v_#memory_int_130|) (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_131|, #length=|v_#length_133|, 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_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, #length=|v_#length_133|, 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~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 1475#[L93-3, L47-4]don't care [459] L93-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_12|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, 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_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1483#[thread2ENTRY, L93-4, L47-4]don't care [544] L93-4-->L94-1: Formula: (and (= (select |v_#valid_112| |v_ULTIMATE.start_main_~#t1~0#1.base_19|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_17|) (= |v_ULTIMATE.start_main_#t~mem16#1_10| (select (select |v_#memory_int_84| |v_ULTIMATE.start_main_~#t1~0#1.base_19|) |v_ULTIMATE.start_main_~#t1~0#1.offset_17|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_17|) (select |v_#length_93| |v_ULTIMATE.start_main_~#t1~0#1.base_19|))) InVars {#valid=|v_#valid_112|, #memory_int=|v_#memory_int_84|, #length=|v_#length_93|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_19|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_17|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_15|, #valid=|v_#valid_112|, #memory_int=|v_#memory_int_84|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_10|, #length=|v_#length_93|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_19|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_17|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~nondet15#1] 1481#[thread2ENTRY, L94-1, L47-4]don't care [2022-07-22 12:25:24,286 INFO L750 eck$LassoCheckResult]: Loop: 1481#[thread2ENTRY, L94-1, L47-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 1481#[thread2ENTRY, L94-1, L47-4]don't care [2022-07-22 12:25:24,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1055789685, now seen corresponding path program 1 times [2022-07-22 12:25:24,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927173401] [2022-07-22 12:25:24,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash 592, now seen corresponding path program 5 times [2022-07-22 12:25:24,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972523312] [2022-07-22 12:25:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1630258694, now seen corresponding path program 2 times [2022-07-22 12:25:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652742564] [2022-07-22 12:25:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:25:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:24,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:25:24,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652742564] [2022-07-22 12:25:24,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652742564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:25:24,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108930571] [2022-07-22 12:25:24,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 12:25:24,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:25:24,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:24,389 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:25:24,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-07-22 12:25:24,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 12:25:24,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 12:25:24,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 12:25:24,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:25:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:24,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:25:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:25:24,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108930571] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:25:24,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:25:24,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-22 12:25:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613730628] [2022-07-22 12:25:24,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:25:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:25:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 12:25:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-22 12:25:24,646 INFO L87 Difference]: Start difference. First operand 44 states and 110 transitions. cyclomatic complexity: 82 Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 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:24,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:25:24,814 INFO L93 Difference]: Finished difference Result 86 states and 194 transitions. [2022-07-22 12:25:24,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 194 transitions. [2022-07-22 12:25:24,815 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:25:24,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 189 transitions. [2022-07-22 12:25:24,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-22 12:25:24,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2022-07-22 12:25:24,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 189 transitions. [2022-07-22 12:25:24,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:25:24,818 INFO L220 hiAutomatonCegarLoop]: Abstraction has 84 states and 189 transitions. [2022-07-22 12:25:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 189 transitions. [2022-07-22 12:25:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2022-07-22 12:25:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.359375) internal successors, (151), 63 states have internal predecessors, (151), 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:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 151 transitions. [2022-07-22 12:25:24,824 INFO L242 hiAutomatonCegarLoop]: Abstraction has 64 states and 151 transitions. [2022-07-22 12:25:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 12:25:24,825 INFO L425 stractBuchiCegarLoop]: Abstraction has 64 states and 151 transitions. [2022-07-22 12:25:24,825 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:25:24,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 151 transitions. [2022-07-22 12:25:24,826 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:25:24,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:25:24,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:25:24,826 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:25:24,827 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:25:24,828 INFO L748 eck$LassoCheckResult]: Stem: 1722#[ULTIMATE.startENTRY]don't care [598] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse1 (store |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55| 1)) (.cse0 (select |v_#memory_int_172| 1))) (and (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~n~0_107) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_58| 4294967296) 1073741823) 1 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select |v_#valid_207| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~q~0.base_108 0) (= (select .cse0 0) 48) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_27|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_55|) 0) (= (select |v_#valid_207| 2) 1) (< |v_#StackHeapBarrier_27| |v_ULTIMATE.start_main_~#t2~0#1.base_55|) (= 2 (select |v_#length_178| 1)) (= v_~q~0.offset_108 0) (= (select |v_#length_178| 2) 25) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= v_~s~0_55 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1) |v_#valid_206|) (= (select |v_#valid_207| 1) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_119| 0)) (< 0 |v_#StackHeapBarrier_27|) (= v_~q_back~0_176 v_~q_front~0_106) (= (select |v_#valid_207| 0) 0) (= (select .cse0 1) 0) (= |v_#NULL.offset_8| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_47| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= (store (store (store |v_#length_178| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_55| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_58|)) |v_#length_177|) (= |v_#NULL.base_8| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_27|, #valid=|v_#valid_207|, #memory_int=|v_#memory_int_172|, #length=|v_#length_178|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~q_back~0=v_~q_back~0_176, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_47|, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_32|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ~q~0.offset=v_~q~0.offset_108, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_119|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_24|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_37|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, #length=|v_#length_177|, ~q_front~0=v_~q_front~0_106, ~s~0=v_~s~0_55, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_39|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_36|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ~N~0=v_~N~0_77, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~q~0.base=v_~q~0.base_108, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_58|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_32|, #StackHeapBarrier=|v_#StackHeapBarrier_27|, 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|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_37|, #valid=|v_#valid_206|, #memory_int=|v_#memory_int_172|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_39|, ~n~0=v_~n~0_107, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_55|, 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, ~q_back~0, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~q~0.offset, 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~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ~q_front~0, ~s~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, ~q~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1724#[L108-6]don't care [582] L108-6-->L108-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_174| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (= (store |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_151| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|)) |v_#memory_int_150|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_151|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_35|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_25|, 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_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_19|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_150|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_34|, #length=|v_#length_149|, 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_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1] 1728#[L108-6]don't care [596] L108-6-->L92-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |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|) (= (select |v_#valid_In_7| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| (ite (<= 0 v_~N~0_In_3) 1 0)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre12#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= (store |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |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~pre12#1_Out_2|)) |v_#memory_int_Out_2|) (= v_~q~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (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_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~q~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= |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|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_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_5|} OutVars{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~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ~N~0=v_~N~0_In_3, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ~q~0.base=v_~q~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.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ~q~0.offset=v_~q~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #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~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_In_7|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ~q~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~q~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1772#[L92-3]don't care [456] L92-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_12|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, 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~mem4#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#res#1.base] 1666#[thread1ENTRY, L92-4]don't care [433] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1] 1668#[L92-4, L47-4]don't care [561] L47-4-->L47-4: Formula: (let ((.cse1 (* v_~q_back~0_141 4))) (let ((.cse0 (+ v_~q~0.offset_76 .cse1))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31| 0)) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_40| v_~N~0_41) (= 1 (select |v_#valid_136| v_~q~0.base_76)) (<= (+ v_~q~0.offset_76 4 .cse1) (select |v_#length_115| v_~q~0.base_76)) (= (ite (= (select (select |v_#memory_int_114| v_~q~0.base_76) .cse0) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|) (not (= (ite (and (< v_~q_back~0_141 v_~n~0_81) (<= 0 v_~q_back~0_141)) 1 0) 0)) (= (+ v_~q_back~0_141 1) v_~q_back~0_140) (= |v_thread1Thread1of1ForFork0_~i~0#1_39| (+ |v_thread1Thread1of1ForFork0_~i~0#1_40| 1))))) InVars {~q_back~0=v_~q_back~0_141, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_40|, #valid=|v_#valid_136|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~n~0=v_~n~0_81, ~q~0.offset=v_~q~0.offset_76} OutVars{~q_back~0=v_~q_back~0_140, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_13|, ~N~0=v_~N~0_41, ~q~0.base=v_~q~0.base_76, ~q~0.offset=v_~q~0.offset_76, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_31|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_39|, #valid=|v_#valid_136|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|, #memory_int=|v_#memory_int_114|, #length=|v_#length_115|, ~n~0=v_~n~0_81} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1] 1732#[L92-4, L47-4]don't care [571] L92-4-->L93-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_31| 4) (select |v_#length_133| |v_ULTIMATE.start_main_~#t2~0#1.base_35|)) (= |v_ULTIMATE.start_main_#t~pre14#1_27| |v_#pthreadsForks_52|) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) |v_ULTIMATE.start_main_~#t2~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre14#1_27|)) |v_#memory_int_130|) (= (select |v_#valid_154| |v_ULTIMATE.start_main_~#t2~0#1.base_35|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_31|) (= |v_#pthreadsForks_51| (+ |v_#pthreadsForks_52| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_52|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_131|, #length=|v_#length_133|, 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_23|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, #pthreadsForks=|v_#pthreadsForks_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_31|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_130|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_9|, #length=|v_#length_133|, 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~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1] 1714#[L93-3, L47-4]don't care [459] L93-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_12|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, 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_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_4|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post7#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1676#[thread2ENTRY, L93-4, L47-4]don't care [444] thread2ENTRY-->L65-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~j~0#1] 1742#[L47-4, L93-4, L65-2]don't care [2022-07-22 12:25:24,828 INFO L750 eck$LassoCheckResult]: Loop: 1742#[L47-4, L93-4, L65-2]don't care [557] L65-2-->L65-2: Formula: (let ((.cse0 (* v_~q_front~0_73 4))) (let ((.cse1 (+ v_~q~0.offset_68 .cse0))) (and (<= (+ v_~q~0.offset_68 .cse0 4) (select |v_#length_105| v_~q~0.base_68)) (= (ite (and (< v_~q_front~0_73 v_~n~0_73) (< v_~q_front~0_73 v_~q_back~0_128) (<= 0 v_~q_front~0_73)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (= (+ v_~s~0_30 |v_thread2Thread1of1ForFork1_~j~0#1_29|) v_~s~0_29) (= (select |v_#valid_126| v_~q~0.base_68) 1) (= (select (select |v_#memory_int_100| v_~q~0.base_68) .cse1) |v_thread2Thread1of1ForFork1_~j~0#1_29|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) (not (= |v_thread2Thread1of1ForFork1_~j~0#1_29| 0)) (<= 0 .cse1) (= (+ v_~q_front~0_73 1) v_~q_front~0_72)))) InVars {~q_back~0=v_~q_back~0_128, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~q~0.base=v_~q~0.base_68, ~n~0=v_~n~0_73, ~q~0.offset=v_~q~0.offset_68, ~s~0=v_~s~0_30, ~q_front~0=v_~q_front~0_73} OutVars{thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_29|, ~q_back~0=v_~q_back~0_128, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_17|, ~q~0.base=v_~q~0.base_68, ~q~0.offset=v_~q~0.offset_68, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_17|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, #valid=|v_#valid_126|, #memory_int=|v_#memory_int_100|, #length=|v_#length_105|, ~n~0=v_~n~0_73, ~s~0=v_~s~0_29, ~q_front~0=v_~q_front~0_72} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~s~0, ~q_front~0] 1742#[L47-4, L93-4, L65-2]don't care [2022-07-22 12:25:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1055789785, now seen corresponding path program 1 times [2022-07-22 12:25:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131304445] [2022-07-22 12:25:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,867 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 2 times [2022-07-22 12:25:24,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994984311] [2022-07-22 12:25:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:25:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1630255590, now seen corresponding path program 1 times [2022-07-22 12:25:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:25:24,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777965699] [2022-07-22 12:25:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:25:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:25:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:25:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:25:24,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:25:26,605 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:25:26,605 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:25:26,605 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:25:26,605 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:25:26,605 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:25:26,605 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:26,605 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:25:26,605 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:25:26,606 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-queue-add-2.wvr.c_BEv2_Iteration8_Lasso [2022-07-22 12:25:26,606 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:25:26,606 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:25:26,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:25:26,617 INFO L141 MapEliminator]: 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:26,620 INFO L141 MapEliminator]: 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:26,622 INFO L141 MapEliminator]: 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:26,623 INFO L141 MapEliminator]: 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:26,625 INFO L141 MapEliminator]: 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:26,627 INFO L141 MapEliminator]: 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:26,629 INFO L141 MapEliminator]: 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:26,630 INFO L141 MapEliminator]: 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:26,912 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:26,915 INFO L158 Benchmark]: Toolchain (without parser) took 25290.30ms. Allocated memory was 160.4MB in the beginning and 305.1MB in the end (delta: 144.7MB). Free memory was 134.9MB in the beginning and 112.5MB in the end (delta: 22.4MB). Peak memory consumption was 168.4MB. Max. memory is 8.0GB. [2022-07-22 12:25:26,915 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 160.4MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:25:26,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.06ms. Allocated memory is still 160.4MB. Free memory was 134.7MB in the beginning and 123.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:25:26,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.78ms. Allocated memory is still 160.4MB. Free memory was 123.8MB in the beginning and 121.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:25:26,917 INFO L158 Benchmark]: Boogie Preprocessor took 34.19ms. Allocated memory is still 160.4MB. Free memory was 121.8MB in the beginning and 120.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:25:26,917 INFO L158 Benchmark]: RCFGBuilder took 911.89ms. Allocated memory is still 160.4MB. Free memory was 120.2MB in the beginning and 135.0MB in the end (delta: -14.8MB). Peak memory consumption was 19.6MB. Max. memory is 8.0GB. [2022-07-22 12:25:26,917 INFO L158 Benchmark]: BuchiAutomizer took 23997.49ms. Allocated memory was 160.4MB in the beginning and 305.1MB in the end (delta: 144.7MB). Free memory was 135.0MB in the beginning and 112.5MB in the end (delta: 22.5MB). Peak memory consumption was 167.7MB. Max. memory is 8.0GB. [2022-07-22 12:25:26,919 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.23ms. Allocated memory is still 160.4MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.06ms. Allocated memory is still 160.4MB. Free memory was 134.7MB in the beginning and 123.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.78ms. Allocated memory is still 160.4MB. Free memory was 123.8MB in the beginning and 121.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.19ms. Allocated memory is still 160.4MB. Free memory was 121.8MB in the beginning and 120.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 911.89ms. Allocated memory is still 160.4MB. Free memory was 120.2MB in the beginning and 135.0MB in the end (delta: -14.8MB). Peak memory consumption was 19.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 23997.49ms. Allocated memory was 160.4MB in the beginning and 305.1MB in the end (delta: 144.7MB). Free memory was 135.0MB in the beginning and 112.5MB in the end (delta: 22.5MB). Peak memory consumption was 167.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 125 PlacesBefore, 21 PlacesAfterwards, 129 TransitionsBefore, 17 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 8 FixpointIterations, 89 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 7 ConcurrentYvCompositions, 8 ChoiceCompositions, 137 TotalNumberOfCompositions, 668 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 626, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 389, positive: 382, positive conditional: 0, positive unconditional: 382, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 389, positive: 377, positive conditional: 0, positive unconditional: 377, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 626, positive: 227, positive conditional: 0, positive unconditional: 227, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 389, unknown conditional: 0, unknown unconditional: 389] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:25:26,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-07-22 12:25:27,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...