/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:50:38,043 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:50:38,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:50:38,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:50:38,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:50:38,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:50:38,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:50:38,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:50:38,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:50:38,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:50:38,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:50:38,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:50:38,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:50:38,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:50:38,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:50:38,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:50:38,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:50:38,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:50:38,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:50:38,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:50:38,110 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:50:38,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:50:38,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:50:38,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:50:38,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:50:38,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:50:38,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:50:38,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:50:38,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:50:38,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:50:38,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:50:38,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:50:38,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:50:38,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:50:38,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:50:38,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:50:38,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:50:38,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:50:38,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:50:38,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:50:38,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:50:38,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:50:38,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:50:38,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:50:38,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:50:38,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:50:38,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:50:38,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:50:38,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:50:38,203 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:50:38,203 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:50:38,203 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:50:38,204 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:50:38,204 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:50:38,205 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:50:38,205 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:50:38,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:50:38,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:50:38,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:50:38,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:50:38,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:50:38,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:50:38,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:50:38,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:50:38,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:50:38,207 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:50:38,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:50:38,208 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:50:38,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:50:38,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:50:38,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:50:38,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:50:38,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:50:38,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:50:38,210 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:50:38,212 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:50:38,213 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:50:38,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:50:38,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:50:38,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:50:38,660 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:50:38,661 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:50:38,662 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-07-22 12:50:38,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678bb29f1/0ff55ed0c28e4254b80926489d254a87/FLAG8da753237 [2022-07-22 12:50:39,412 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:50:39,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-07-22 12:50:39,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678bb29f1/0ff55ed0c28e4254b80926489d254a87/FLAG8da753237 [2022-07-22 12:50:39,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678bb29f1/0ff55ed0c28e4254b80926489d254a87 [2022-07-22 12:50:39,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:50:39,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:50:39,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:50:39,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:50:39,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:50:39,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:50:39" (1/1) ... [2022-07-22 12:50:39,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@782ce460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:39, skipping insertion in model container [2022-07-22 12:50:39,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:50:39" (1/1) ... [2022-07-22 12:50:39,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:50:39,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:50:40,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-07-22 12:50:40,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:50:40,164 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:50:40,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-07-22 12:50:40,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:50:40,225 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:50:40,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40 WrapperNode [2022-07-22 12:50:40,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:50:40,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:50:40,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:50:40,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:50:40,237 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:50:40" (1/1) ... [2022-07-22 12:50:40,248 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:50:40" (1/1) ... [2022-07-22 12:50:40,280 INFO L137 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 162 [2022-07-22 12:50:40,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:50:40,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:50:40,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:50:40,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:50:40,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:50:40,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:50:40,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:50:40,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:50:40,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (1/1) ... [2022-07-22 12:50:40,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:40,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:40,382 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:50:40,405 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:50:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:50:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:50:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:50:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:50:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:50:40,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:50:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:50:40,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:50:40,476 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:50:40,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:50:40,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:50:40,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:50:40,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:50:40,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:50:40,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:50:40,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:50:40,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:50:40,479 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:50:40,593 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:50:40,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:50:40,934 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:50:41,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:50:41,057 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:50:41,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:50:41 BoogieIcfgContainer [2022-07-22 12:50:41,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:50:41,061 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:50:41,062 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:50:41,067 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:50:41,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:41,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:50:39" (1/3) ... [2022-07-22 12:50:41,069 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4459130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:50:41, skipping insertion in model container [2022-07-22 12:50:41,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:41,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:40" (2/3) ... [2022-07-22 12:50:41,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4459130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:50:41, skipping insertion in model container [2022-07-22 12:50:41,070 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:41,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:50:41" (3/3) ... [2022-07-22 12:50:41,072 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-07-22 12:50:41,163 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:50:41,204 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 150 places, 154 transitions, 332 flow [2022-07-22 12:50:41,283 INFO L129 PetriNetUnfolder]: 11/148 cut-off events. [2022-07-22 12:50:41,284 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:50:41,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 11/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-07-22 12:50:41,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 154 transitions, 332 flow [2022-07-22 12:50:41,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 148 transitions, 314 flow [2022-07-22 12:50:41,305 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:50:41,316 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 148 transitions, 314 flow [2022-07-22 12:50:41,320 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 148 transitions, 314 flow [2022-07-22 12:50:41,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 148 transitions, 314 flow [2022-07-22 12:50:41,359 INFO L129 PetriNetUnfolder]: 11/148 cut-off events. [2022-07-22 12:50:41,359 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:50:41,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 11/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 81 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2022-07-22 12:50:41,364 INFO L116 LiptonReduction]: Number of co-enabled transitions 1082 [2022-07-22 12:50:47,025 INFO L131 LiptonReduction]: Checked pairs total: 1971 [2022-07-22 12:50:47,026 INFO L133 LiptonReduction]: Total number of compositions: 145 [2022-07-22 12:50:47,048 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:50:47,049 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:50:47,049 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:50:47,049 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:50:47,049 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:50:47,049 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:50:47,050 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:50:47,050 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:50:47,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:50:47,141 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 113 [2022-07-22 12:50:47,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:47,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:47,149 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:50:47,149 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:47,150 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:50:47,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 156 states, but on-demand construction may add more states [2022-07-22 12:50:47,161 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 113 [2022-07-22 12:50:47,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:47,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:47,162 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:50:47,162 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:47,168 INFO L748 eck$LassoCheckResult]: Stem: 153#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 156#[L126-6]don't care [2022-07-22 12:50:47,169 INFO L750 eck$LassoCheckResult]: Loop: 156#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 156#[L126-6]don't care [2022-07-22 12:50:47,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 636, now seen corresponding path program 1 times [2022-07-22 12:50:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:47,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398183827] [2022-07-22 12:50:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:47,358 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:47,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2022-07-22 12:50:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:47,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451214942] [2022-07-22 12:50:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:47,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:47,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:47,529 INFO L85 PathProgramCache]: Analyzing trace with hash 20290, now seen corresponding path program 1 times [2022-07-22 12:50:47,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:47,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646891606] [2022-07-22 12:50:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:47,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:47,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:47,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:48,720 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:48,721 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:48,721 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:48,721 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:48,721 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:48,721 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:48,721 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:48,722 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:48,722 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:50:48,722 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:48,722 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:48,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:48,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,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:50:49,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,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:50:49,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,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:50:49,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:50:49,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,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:50:49,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,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:50:49,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,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:50:49,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:49,788 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:49,793 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:49,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:49,800 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:50:49,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:49,807 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:50:49,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:49,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:49,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:49,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:49,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:49,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:49,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:49,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:49,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:49,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:49,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:49,859 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:50:49,860 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:50:49,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:49,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:49,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:49,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:49,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:49,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:49,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:49,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:49,908 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:50:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:49,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:49,910 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:50:49,911 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:50:49,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:49,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:49,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:49,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:49,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:49,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:49,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:49,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:49,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:49,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:49,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:49,976 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:50:49,982 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:50:49,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:49,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:49,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:49,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:49,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:49,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:49,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:49,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:49,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,015 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:50:50,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,017 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:50:50,018 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:50:50,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:50,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:50,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:50,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:50,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,053 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:50:50,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,054 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:50:50,055 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:50:50,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:50,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:50,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:50,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,092 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:50:50,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,094 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:50:50,094 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:50:50,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:50,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:50,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:50,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:50,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,131 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:50:50,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,133 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:50:50,135 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:50:50,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:50,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:50,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:50,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:50,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,168 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:50:50,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,170 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:50:50,171 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:50:50,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:50,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:50,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:50,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,249 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:50:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,251 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:50:50,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:50,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:50,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:50,273 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:50:50,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,305 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:50:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,307 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:50:50,309 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:50:50,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:50,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:50,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:50,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,385 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:50:50,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,387 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:50:50,392 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:50:50,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:50,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:50,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:50,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,457 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:50:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,459 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:50:50,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:50,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:50,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:50,483 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:50:50,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:50,518 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:50:50,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,520 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:50:50,522 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:50:50,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:50,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:50,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:50,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:50,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:50,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:50,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:50,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:50,594 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:50:50,595 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-22 12:50:50,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:50,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:50,605 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:50:50,609 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:50,618 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:50:50,651 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:50:50,652 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:50,653 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~0#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -2*ULTIMATE.start_create_fresh_int_array_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 2*ULTIMATE.start_create_fresh_int_array_~size#1 >= 0] [2022-07-22 12:50:50,703 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:50:50,843 INFO L257 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-07-22 12:50:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:50,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:50:50,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:50,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:50:50,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:50,940 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:50:50,979 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:50:50,982 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 156 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:51,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 156 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 158 states and 440 transitions. Complement of second has 3 states. [2022-07-22 12:50:51,058 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:50:51,064 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:50:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:50:51,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:50:51,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:51,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:50:51,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:51,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:50:51,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:51,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 440 transitions. [2022-07-22 12:50:51,076 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:50:51,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 142 states and 404 transitions. [2022-07-22 12:50:51,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-07-22 12:50:51,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-22 12:50:51,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 404 transitions. [2022-07-22 12:50:51,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:51,102 INFO L220 hiAutomatonCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-22 12:50:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 404 transitions. [2022-07-22 12:50:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-22 12:50:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.8450704225352115) internal successors, (404), 141 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 404 transitions. [2022-07-22 12:50:51,162 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-22 12:50:51,162 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 404 transitions. [2022-07-22 12:50:51,162 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:50:51,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 404 transitions. [2022-07-22 12:50:51,173 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:50:51,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:51,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:51,174 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:50:51,174 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:51,175 INFO L748 eck$LassoCheckResult]: Stem: 1019#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 945#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 747#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 749#[thread1ENTRY, L108-4]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 973#[L48-4, L108-4]don't care [2022-07-22 12:50:51,177 INFO L750 eck$LassoCheckResult]: Loop: 973#[L48-4, L108-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 971#[L55, L108-4]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 973#[L48-4, L108-4]don't care [2022-07-22 12:50:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 19540963, now seen corresponding path program 1 times [2022-07-22 12:50:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:51,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370162929] [2022-07-22 12:50:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:51,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 18619, now seen corresponding path program 1 times [2022-07-22 12:50:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:51,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271328031] [2022-07-22 12:50:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:51,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1599013917, now seen corresponding path program 1 times [2022-07-22 12:50:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:51,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254636651] [2022-07-22 12:50:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:51,417 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:50:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:51,538 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:50:51,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254636651] [2022-07-22 12:50:51,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254636651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:50:51,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:50:51,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:50:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253535081] [2022-07-22 12:50:51,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:50:51,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:51,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:50:51,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:50:51,656 INFO L87 Difference]: Start difference. First operand 142 states and 404 transitions. cyclomatic complexity: 299 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:51,749 INFO L93 Difference]: Finished difference Result 225 states and 591 transitions. [2022-07-22 12:50:51,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 591 transitions. [2022-07-22 12:50:51,754 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:50:51,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 142 states and 403 transitions. [2022-07-22 12:50:51,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2022-07-22 12:50:51,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 141 [2022-07-22 12:50:51,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 403 transitions. [2022-07-22 12:50:51,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:51,761 INFO L220 hiAutomatonCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-22 12:50:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 403 transitions. [2022-07-22 12:50:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-22 12:50:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 2.8380281690140845) internal successors, (403), 141 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 403 transitions. [2022-07-22 12:50:51,777 INFO L242 hiAutomatonCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-22 12:50:51,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:50:51,779 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 403 transitions. [2022-07-22 12:50:51,779 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:50:51,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 403 transitions. [2022-07-22 12:50:51,781 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 112 [2022-07-22 12:50:51,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:51,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:51,782 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:50:51,782 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:51,783 INFO L748 eck$LassoCheckResult]: Stem: 1539#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1465#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 1467#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1267#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 1269#[thread1ENTRY, L108-4]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 1493#[L48-4, L108-4]don't care [2022-07-22 12:50:51,783 INFO L750 eck$LassoCheckResult]: Loop: 1493#[L48-4, L108-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 1491#[L55, L108-4]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 1493#[L48-4, L108-4]don't care [2022-07-22 12:50:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 605053277, now seen corresponding path program 1 times [2022-07-22 12:50:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:51,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524856170] [2022-07-22 12:50:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:51,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 18619, now seen corresponding path program 2 times [2022-07-22 12:50:51,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:51,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851475486] [2022-07-22 12:50:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:51,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1635631895, now seen corresponding path program 1 times [2022-07-22 12:50:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:51,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102666115] [2022-07-22 12:50:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:51,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:52,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:54,265 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:54,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:54,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:54,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:54,266 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:54,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:54,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:54,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:54,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:50:54,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:54,267 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:54,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:54,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:54,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,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:50:55,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:50:55,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:55,845 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:55,848 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:55,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:55,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:55,849 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:50:55,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:55,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:55,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:55,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:55,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:55,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:55,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:55,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:55,866 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:50:55,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:55,898 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:50:55,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:55,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:55,900 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:50:55,900 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:50:55,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:55,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:55,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:55,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:55,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:55,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:55,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:55,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:55,967 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:50:55,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:55,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:55,969 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:50:55,975 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:50:55,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:55,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:55,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:55,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:55,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:55,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:55,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:55,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:56,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:56,035 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:50:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:56,037 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:50:56,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:56,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:56,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:56,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:56,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:56,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:56,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:56,058 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:50:56,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:56,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:56,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:56,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:56,102 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:50:56,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:50:56,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:56,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:56,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:56,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:56,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:56,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:56,136 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:50:56,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:56,178 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:50:56,179 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-22 12:50:56,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:56,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:56,180 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:50:56,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:56,198 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:50:56,210 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:50:56,211 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:56,211 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~back~0, ~n~0) = -1*~back~0 + 1*~n~0 Supporting invariants [] [2022-07-22 12:50:56,242 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:50:56,402 INFO L257 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2022-07-22 12:50:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:56,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:56,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:56,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:50:56,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:56,482 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:50:56,483 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:50:56,485 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 403 transitions. cyclomatic complexity: 298 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:56,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 403 transitions. cyclomatic complexity: 298. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 396 states and 1381 transitions. Complement of second has 4 states. [2022-07-22 12:50:56,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:50:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-07-22 12:50:56,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 5 letters. Loop has 2 letters. [2022-07-22 12:50:56,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:56,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:50:56,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:56,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 5 letters. Loop has 4 letters. [2022-07-22 12:50:56,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:56,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 396 states and 1381 transitions. [2022-07-22 12:50:56,642 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 84 [2022-07-22 12:50:56,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 396 states to 300 states and 1028 transitions. [2022-07-22 12:50:56,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-07-22 12:50:56,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-22 12:50:56,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 300 states and 1028 transitions. [2022-07-22 12:50:56,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:56,657 INFO L220 hiAutomatonCegarLoop]: Abstraction has 300 states and 1028 transitions. [2022-07-22 12:50:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states and 1028 transitions. [2022-07-22 12:50:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 226. [2022-07-22 12:50:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 3.6548672566371683) internal successors, (826), 225 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 826 transitions. [2022-07-22 12:50:56,704 INFO L242 hiAutomatonCegarLoop]: Abstraction has 226 states and 826 transitions. [2022-07-22 12:50:56,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 226 states and 826 transitions. [2022-07-22 12:50:56,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:50:56,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 826 transitions. [2022-07-22 12:50:56,709 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 84 [2022-07-22 12:50:56,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:56,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:56,710 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:56,710 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:50:56,711 INFO L748 eck$LassoCheckResult]: Stem: 2542#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2390#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 2392#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2118#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 2120#[thread1ENTRY, L108-4]don't care [575] L108-4-->L109-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_110| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (store |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_90|) (= (select |v_#valid_143| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_37|)) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_91|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_13|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_90|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 2272#[L109-3, thread1ENTRY]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2274#[L109-4, thread1ENTRY, thread2ENTRY]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_12) InVars {~v_assert~0=v_~v_assert~0_12} OutVars{~v_assert~0=v_~v_assert~0_12, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 2312#[L81, L109-4, thread1ENTRY]don't care [2022-07-22 12:50:56,711 INFO L750 eck$LassoCheckResult]: Loop: 2312#[L81, L109-4, thread1ENTRY]don't care [522] L81-->L75: Formula: (let ((.cse0 (* v_~front~0_41 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_29))) (and (<= (+ .cse0 4 v_~queue~0.offset_29) (select |v_#length_74| v_~queue~0.base_29)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_34)) 1 0)) (= (select |v_#valid_95| v_~queue~0.base_29) 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0)) (= v_~front~0_40 (+ v_~front~0_41 1)) (= (select (select |v_#memory_int_62| v_~queue~0.base_29) .cse1) |v_thread2Thread1of1ForFork1_~temp~0#1_11|) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_95|, ~back~0=v_~back~0_50, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_34, ~front~0=v_~front~0_41} OutVars{~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_11|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~n~0=v_~n~0_34, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 2506#[L109-4, thread1ENTRY, L75]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 2486#[L109-4, thread1ENTRY, L78]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 2312#[L81, L109-4, thread1ENTRY]don't care [2022-07-22 12:50:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1635774901, now seen corresponding path program 1 times [2022-07-22 12:50:56,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:56,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657618279] [2022-07-22 12:50:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:56,785 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:56,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 1 times [2022-07-22 12:50:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:56,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293100758] [2022-07-22 12:50:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:56,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:56,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 671651126, now seen corresponding path program 1 times [2022-07-22 12:50:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:56,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519456402] [2022-07-22 12:50:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:56,941 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:50:56,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:56,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519456402] [2022-07-22 12:50:56,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519456402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:50:56,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:50:56,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:50:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548954554] [2022-07-22 12:50:56,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:50:57,044 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:50:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:57,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:50:57,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:50:57,118 INFO L87 Difference]: Start difference. First operand 226 states and 826 transitions. cyclomatic complexity: 643 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:57,184 INFO L93 Difference]: Finished difference Result 278 states and 855 transitions. [2022-07-22 12:50:57,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 855 transitions. [2022-07-22 12:50:57,190 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-22 12:50:57,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 229 states and 706 transitions. [2022-07-22 12:50:57,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-22 12:50:57,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-22 12:50:57,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 229 states and 706 transitions. [2022-07-22 12:50:57,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:57,196 INFO L220 hiAutomatonCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-22 12:50:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states and 706 transitions. [2022-07-22 12:50:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-07-22 12:50:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 3.0829694323144103) internal successors, (706), 228 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 706 transitions. [2022-07-22 12:50:57,215 INFO L242 hiAutomatonCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-22 12:50:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:50:57,216 INFO L425 stractBuchiCegarLoop]: Abstraction has 229 states and 706 transitions. [2022-07-22 12:50:57,216 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:50:57,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 706 transitions. [2022-07-22 12:50:57,219 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 66 [2022-07-22 12:50:57,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:57,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:57,220 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:57,221 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:50:57,222 INFO L748 eck$LassoCheckResult]: Stem: 3256#[ULTIMATE.startENTRY]don't care [605] ULTIMATE.startENTRY-->L126-6: Formula: (let ((.cse3 (store |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49| 1)) (.cse1 (select |v_#memory_int_114| 1))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58| 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (< 0 |v_#StackHeapBarrier_42|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_#NULL.base_12| 0) (= (store (store (store (store |v_#length_158| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|)) |v_#length_156|) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (= v_~queue~0.base_51 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select |v_#valid_201| 0) 0) (= v_~d~0_17 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= 23 (select |v_#length_158| 2)) (= |v_#valid_199| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_68| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= (select .cse1 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= 0 v_~queue~0.offset_51) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= v_~n~0_60 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= v_~front~0_62 v_~back~0_72) (= 48 (select .cse1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|) (= 2 (select |v_#length_158| 1)) (= 0 (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_49|)) (= (select |v_#valid_201| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_201| 2) 1) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_43|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_37| 0) (= (select |v_#valid_201| 1) 1) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_68|) (= v_~v_assert~0_46 1) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_49|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_201|, #memory_int=|v_#memory_int_114|, #length=|v_#length_158|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_58|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_37|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~W~0=v_~W~0_40, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_20|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_41|, #length=|v_#length_156|, ~front~0=v_~front~0_62, ~queue~0.offset=v_~queue~0.offset_51, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_28|, ~back~0=v_~back~0_72, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~queue~0.base=v_~queue~0.base_51, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_68|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, ~v_assert~0=v_~v_assert~0_46, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_36|, #valid=|v_#valid_199|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_38|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, ~d~0=v_~d~0_17, #memory_int=|v_#memory_int_114|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_29|, ~n~0=v_~n~0_60, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_93|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~W~0, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet6#1, ~back~0, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~v_assert~0, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ~d~0, ULTIMATE.start_create_fresh_int_array_#t~post20#1, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3084#[L126-6]don't care [574] L126-6-->L126-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|))) (and (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4) (select |v_#length_108| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (store |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_87| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|)) |v_#memory_int_86|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_33|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_87|, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet21#1_17|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_32|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_86|, ULTIMATE.start_create_fresh_int_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post20#1_21|, #length=|v_#length_108|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_#t~post20#1] 3086#[L126-6]don't care [603] L126-6-->L108-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~queue~0.base_Out_2) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~queue~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre10#1_Out_2|))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= 0 v_~W~0_In_1) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1} OutVars{~queue~0.offset=v_~queue~0.offset_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_In_3|, ~queue~0.base=v_~queue~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ~W~0=v_~W~0_In_1, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_Out_2|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_Out_2|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_Out_2|, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2854#[L108-3]don't care [451] L108-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_8|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_12|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_4|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_8|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_~cond~0#1, thread1Thread1of1ForFork0_#res#1.base] 2856#[thread1ENTRY, L108-4]don't care [423] thread1ENTRY-->L48-4: Formula: (= |v_thread1Thread1of1ForFork0_~w~0#1_1| v_~W~0_1) InVars {~W~0=v_~W~0_1} OutVars{thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_1|, ~W~0=v_~W~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~w~0#1] 3224#[L48-4, L108-4]don't care [552] L48-4-->L55: Formula: (and (= v_~v_assert~0_22 |v_thread1Thread1of1ForFork0_~cond~0#1_15|) (not (= (mod |v_thread1Thread1of1ForFork0_~cond~0#1_15| 256) 0)) (< 0 |v_thread1Thread1of1ForFork0_~w~0#1_25|)) InVars {~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|} OutVars{~v_assert~0=v_~v_assert~0_22, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_25|, thread1Thread1of1ForFork0_~cond~0#1=|v_thread1Thread1of1ForFork0_~cond~0#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~cond~0#1] 3120#[L55, L108-4]don't care [546] L55-->L48-4: Formula: (let ((.cse0 (* 4 v_~back~0_55))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_33))) (and (= (+ |v_thread1Thread1of1ForFork0_~w~0#1_19| 1) |v_thread1Thread1of1ForFork0_~w~0#1_20|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|) (<= (+ 4 .cse0 v_~queue~0.offset_33) (select |v_#length_92| v_~queue~0.base_33)) (<= 0 .cse1) (= (select |v_#valid_119| v_~queue~0.base_33) 1) (= (+ v_~back~0_55 1) v_~back~0_54) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= (ite (= (select (select |v_#memory_int_70| v_~queue~0.base_33) .cse1) 1) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= (ite (and (< v_~back~0_55 v_~n~0_40) (<= 0 v_~back~0_55)) 1 0) 0))))) InVars {~queue~0.offset=v_~queue~0.offset_33, #valid=|v_#valid_119|, ~back~0=v_~back~0_55, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_20|, #length=|v_#length_92|, ~queue~0.base=v_~queue~0.base_33, ~n~0=v_~n~0_40} OutVars{~queue~0.offset=v_~queue~0.offset_33, ~back~0=v_~back~0_54, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_33, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_15|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_7|, #valid=|v_#valid_119|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_70|, thread1Thread1of1ForFork0_~w~0#1=|v_thread1Thread1of1ForFork0_~w~0#1_19|, #length=|v_#length_92|, ~n~0=v_~n~0_40} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post1#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_~w~0#1, thread1Thread1of1ForFork0_#t~mem2#1] 3122#[L48-4, L108-4]don't care [575] L108-4-->L109-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_110| |v_ULTIMATE.start_main_~#t2~0#1.base_31|)) (= (store |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_91| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre12#1_21|)) |v_#memory_int_90|) (= (select |v_#valid_143| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_ULTIMATE.start_main_#t~pre12#1_21| |v_#pthreadsForks_37|)) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, #memory_int=|v_#memory_int_91|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_13|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_143|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_90|, #length=|v_#length_110|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] 3236#[L109-3, L48-4]don't care [454] L109-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_4|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_10|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_4|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3290#[L48-4, L109-4, thread2ENTRY]don't care [518] thread2ENTRY-->L81: Formula: (= |v_thread2Thread1of1ForFork1_~cond~1#1_13| v_~v_assert~0_12) InVars {~v_assert~0=v_~v_assert~0_12} OutVars{~v_assert~0=v_~v_assert~0_12, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_13|, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, thread2Thread1of1ForFork1_~temp~0#1] 3212#[L48-4, L81, L109-4]don't care [2022-07-22 12:50:57,222 INFO L750 eck$LassoCheckResult]: Loop: 3212#[L48-4, L81, L109-4]don't care [522] L81-->L75: Formula: (let ((.cse0 (* v_~front~0_41 4))) (let ((.cse1 (+ .cse0 v_~queue~0.offset_29))) (and (<= (+ .cse0 4 v_~queue~0.offset_29) (select |v_#length_74| v_~queue~0.base_29)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_34)) 1 0)) (= (select |v_#valid_95| v_~queue~0.base_29) 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~1#1_15| 256) 0)) (= v_~front~0_40 (+ v_~front~0_41 1)) (= (select (select |v_#memory_int_62| v_~queue~0.base_29) .cse1) |v_thread2Thread1of1ForFork1_~temp~0#1_11|) (<= 0 .cse1)))) InVars {~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, #valid=|v_#valid_95|, ~back~0=v_~back~0_50, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~queue~0.base=v_~queue~0.base_29, ~n~0=v_~n~0_34, ~front~0=v_~front~0_41} OutVars{~queue~0.offset=v_~queue~0.offset_29, thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_11|, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_29, thread2Thread1of1ForFork1_#t~post5#1=|v_thread2Thread1of1ForFork1_#t~post5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_#t~mem4#1=|v_thread2Thread1of1ForFork1_#t~mem4#1_5|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_62|, #length=|v_#length_74|, ~n~0=v_~n~0_34, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~temp~0#1, thread2Thread1of1ForFork1_#t~mem4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~front~0] 3056#[L48-4, L109-4, L75]don't care [444] L75-->L78: Formula: (= (+ |v_thread2Thread1of1ForFork1_~temp~0#1_5| v_~d~0_2) v_~d~0_1) InVars {thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_2} OutVars{thread2Thread1of1ForFork1_~temp~0#1=|v_thread2Thread1of1ForFork1_~temp~0#1_5|, ~d~0=v_~d~0_1} AuxVars[] AssignedVars[~d~0] 3062#[L48-4, L109-4, L78]don't care [445] L78-->L81: Formula: (= v_~v_assert~0_2 |v_thread2Thread1of1ForFork1_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1] 3212#[L48-4, L81, L109-4]don't care [2022-07-22 12:50:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash 706377992, now seen corresponding path program 1 times [2022-07-22 12:50:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:57,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491396954] [2022-07-22 12:50:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:57,306 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:57,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 545642, now seen corresponding path program 2 times [2022-07-22 12:50:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:57,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980055299] [2022-07-22 12:50:57,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:57,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:57,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:57,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1632474877, now seen corresponding path program 1 times [2022-07-22 12:50:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:57,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876963100] [2022-07-22 12:50:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:57,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:57,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:59,906 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:59,906 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:59,907 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:59,907 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:59,907 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:59,907 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:59,907 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:59,907 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:59,907 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-prod-cons.wvr.c_BEv2_Iteration5_Lasso [2022-07-22 12:50:59,907 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:59,907 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:59,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:50:59,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,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:50:59,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:50:59,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:50:59,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:50:59,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:50:59,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:50:59,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,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:50:59,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,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:50:59,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,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:50:59,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,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:50:59,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:59,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:51:01,111 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:51:01,115 INFO L158 Benchmark]: Toolchain (without parser) took 21349.03ms. Allocated memory was 154.1MB in the beginning and 223.3MB in the end (delta: 69.2MB). Free memory was 128.5MB in the beginning and 133.6MB in the end (delta: -5.0MB). Peak memory consumption was 112.9MB. Max. memory is 8.0GB. [2022-07-22 12:51:01,115 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:51:01,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.85ms. Allocated memory is still 154.1MB. Free memory was 128.3MB in the beginning and 117.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:51:01,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.68ms. Allocated memory is still 154.1MB. Free memory was 117.1MB in the beginning and 115.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:51:01,117 INFO L158 Benchmark]: Boogie Preprocessor took 41.86ms. Allocated memory is still 154.1MB. Free memory was 115.2MB in the beginning and 113.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:51:01,118 INFO L158 Benchmark]: RCFGBuilder took 733.21ms. Allocated memory is still 154.1MB. Free memory was 113.7MB in the beginning and 132.7MB in the end (delta: -19.0MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2022-07-22 12:51:01,118 INFO L158 Benchmark]: BuchiAutomizer took 20052.51ms. Allocated memory was 154.1MB in the beginning and 223.3MB in the end (delta: 69.2MB). Free memory was 132.7MB in the beginning and 133.6MB in the end (delta: -875.2kB). Peak memory consumption was 115.8MB. Max. memory is 8.0GB. [2022-07-22 12:51:01,121 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.18ms. Allocated memory is still 125.8MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.85ms. Allocated memory is still 154.1MB. Free memory was 128.3MB in the beginning and 117.1MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.68ms. Allocated memory is still 154.1MB. Free memory was 117.1MB in the beginning and 115.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.86ms. Allocated memory is still 154.1MB. Free memory was 115.2MB in the beginning and 113.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 733.21ms. Allocated memory is still 154.1MB. Free memory was 113.7MB in the beginning and 132.7MB in the end (delta: -19.0MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 20052.51ms. Allocated memory was 154.1MB in the beginning and 223.3MB in the end (delta: 69.2MB). Free memory was 132.7MB in the beginning and 133.6MB in the end (delta: -875.2kB). Peak memory consumption was 115.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 147 PlacesBefore, 32 PlacesAfterwards, 148 TransitionsBefore, 25 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 7 FixpointIterations, 93 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 7 ConcurrentYvCompositions, 8 ChoiceCompositions, 145 TotalNumberOfCompositions, 1971 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1546, positive: 1473, positive conditional: 0, positive unconditional: 1473, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 636, positive: 614, positive conditional: 0, positive unconditional: 614, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1546, positive: 859, positive conditional: 0, positive unconditional: 859, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 636, unknown conditional: 0, unknown unconditional: 636] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - 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:51:01,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...