/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:23:44,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:23:44,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:23:44,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:23:44,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:23:44,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:23:44,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:23:44,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:23:44,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:23:44,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:23:44,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:23:44,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:23:44,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:23:44,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:23:44,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:23:44,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:23:44,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:23:44,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:23:44,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:23:44,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:23:44,288 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:23:44,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:23:44,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:23:44,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:23:44,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:23:44,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:23:44,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:23:44,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:23:44,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:23:44,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:23:44,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:23:44,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:23:44,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:23:44,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:23:44,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:23:44,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:23:44,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:23:44,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:23:44,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:23:44,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:23:44,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:23:44,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:23:44,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:23:44,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:23:44,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:23:44,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:23:44,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:23:44,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:23:44,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:23:44,387 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:23:44,387 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:23:44,388 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:23:44,389 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:23:44,389 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:23:44,389 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:23:44,389 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:23:44,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:23:44,390 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:23:44,390 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:23:44,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:23:44,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:23:44,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:23:44,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:23:44,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:23:44,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:23:44,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:23:44,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:23:44,392 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:23:44,392 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:23:44,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:23:44,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:23:44,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:23:44,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:23:44,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:23:44,396 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:23:44,396 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:23:44,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:23:44,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:23:44,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:23:44,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:23:44,884 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:23:44,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c [2022-07-22 12:23:44,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a27073e/2966eaf16b184c0eb41cede9e6a41ae1/FLAG80930f491 [2022-07-22 12:23:45,579 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:23:45,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-le-max.wvr.c [2022-07-22 12:23:45,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a27073e/2966eaf16b184c0eb41cede9e6a41ae1/FLAG80930f491 [2022-07-22 12:23:45,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a27073e/2966eaf16b184c0eb41cede9e6a41ae1 [2022-07-22 12:23:45,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:23:45,972 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:23:45,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:23:45,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:23:45,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:23:45,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:23:45" (1/1) ... [2022-07-22 12:23:45,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1218a55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:45, skipping insertion in model container [2022-07-22 12:23:45,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:23:45" (1/1) ... [2022-07-22 12:23:45,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:23:46,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:23:46,320 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-more-min-le-max.wvr.c[2486,2499] [2022-07-22 12:23:46,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:23:46,351 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:23:46,374 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-more-min-le-max.wvr.c[2486,2499] [2022-07-22 12:23:46,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:23:46,395 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:23:46,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46 WrapperNode [2022-07-22 12:23:46,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:23:46,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:23:46,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:23:46,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:23:46,405 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:23:46" (1/1) ... [2022-07-22 12:23:46,414 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:23:46" (1/1) ... [2022-07-22 12:23:46,441 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-07-22 12:23:46,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:23:46,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:23:46,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:23:46,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:23:46,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:23:46,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:23:46,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:23:46,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:23:46,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (1/1) ... [2022-07-22 12:23:46,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:46,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:46,541 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:23:46,558 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:23:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:23:46,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:23:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:23:46,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:23:46,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:23:46,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:23:46,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:23:46,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:23:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:23:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:23:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:23:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:23:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:23:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:23:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:23:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:23:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:23:46,626 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:23:46,724 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:23:46,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:23:47,117 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:23:47,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:23:47,274 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:23:47,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:23:47 BoogieIcfgContainer [2022-07-22 12:23:47,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:23:47,278 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:23:47,278 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:23:47,282 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:23:47,283 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:23:47,284 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:23:45" (1/3) ... [2022-07-22 12:23:47,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b32a844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:23:47, skipping insertion in model container [2022-07-22 12:23:47,285 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:23:47,285 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:23:46" (2/3) ... [2022-07-22 12:23:47,285 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b32a844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:23:47, skipping insertion in model container [2022-07-22 12:23:47,286 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:23:47,286 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:23:47" (3/3) ... [2022-07-22 12:23:47,287 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2022-07-22 12:23:47,388 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:23:47,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 146 places, 149 transitions, 322 flow [2022-07-22 12:23:47,549 INFO L129 PetriNetUnfolder]: 10/143 cut-off events. [2022-07-22 12:23:47,550 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:23:47,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 10/143 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-22 12:23:47,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 149 transitions, 322 flow [2022-07-22 12:23:47,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 143 transitions, 304 flow [2022-07-22 12:23:47,568 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:23:47,584 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 143 transitions, 304 flow [2022-07-22 12:23:47,587 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 143 transitions, 304 flow [2022-07-22 12:23:47,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 143 transitions, 304 flow [2022-07-22 12:23:47,620 INFO L129 PetriNetUnfolder]: 10/143 cut-off events. [2022-07-22 12:23:47,620 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:23:47,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 10/143 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-22 12:23:47,624 INFO L116 LiptonReduction]: Number of co-enabled transitions 914 [2022-07-22 12:23:53,362 INFO L131 LiptonReduction]: Checked pairs total: 1182 [2022-07-22 12:23:53,362 INFO L133 LiptonReduction]: Total number of compositions: 144 [2022-07-22 12:23:53,388 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:23:53,389 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:23:53,389 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:23:53,389 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:23:53,389 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:23:53,389 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:23:53,389 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:23:53,390 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:23:53,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:23:53,445 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 37 [2022-07-22 12:23:53,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:53,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:53,452 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:23:53,452 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:53,452 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:23:53,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 80 states, but on-demand construction may add more states [2022-07-22 12:23:53,461 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 37 [2022-07-22 12:23:53,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:53,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:53,461 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:23:53,462 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:53,468 INFO L748 eck$LassoCheckResult]: Stem: 149#[ULTIMATE.startENTRY]don't care [546] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse2 (store |v_#valid_251| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_160| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_61| 1))) (and (< 0 |v_#StackHeapBarrier_42|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|) (= (select |v_#length_202| 2) 29) (= 48 (select .cse0 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_62| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_58| 0) (= |v_#NULL.base_12| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_121| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_249|) (= v_~max~0_85 0) (= (store (store (store (store |v_#length_202| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_61| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|)) |v_#length_200|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| v_~N~0_89) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_61|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= v_~min~0_109 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_49| 0) (= (select |v_#length_202| 1) 2) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_121| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= v_~A~0.offset_105 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_61|) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_251| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_251| 1) 1) (= v_~v_assert~0_42 0) (= (select |v_#valid_251| 0) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_53| 0) (= (select |v_#valid_251| 2) 1))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_251|, #memory_int=|v_#memory_int_160|, #length=|v_#length_202|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_53|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_18|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, ~max~0=v_~max~0_85, #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_38|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_121|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_18|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_39|, #length=|v_#length_200|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_58|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, 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_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~N~0=v_~N~0_89, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_32|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_62|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_37|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_17|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_32|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_38|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_15|, ~v_assert~0=v_~v_assert~0_42, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ~A~0.offset=v_~A~0.offset_105, #valid=|v_#valid_249|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_42|, ~min~0=v_~min~0_109, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_43|, #memory_int=|v_#memory_int_160|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#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, ~max~0, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem10#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~v_assert~0, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ~min~0, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 152#[L108-6]don't care [2022-07-22 12:23:53,468 INFO L750 eck$LassoCheckResult]: Loop: 152#[L108-6]don't care [518] L108-6-->L108-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_181| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_142| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 1)) (<= 0 .cse1) (= (store |v_#memory_int_115| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_115| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_19|)) |v_#memory_int_114|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_181|, #memory_int=|v_#memory_int_115|, #length=|v_#length_142|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_181|, #memory_int=|v_#memory_int_114|, #length=|v_#length_142|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_23|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1] 152#[L108-6]don't care [2022-07-22 12:23:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 577, now seen corresponding path program 1 times [2022-07-22 12:23:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:53,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742339304] [2022-07-22 12:23:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:53,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:53,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash 549, now seen corresponding path program 1 times [2022-07-22 12:23:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:53,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074563253] [2022-07-22 12:23:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:53,711 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:53,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 18405, now seen corresponding path program 1 times [2022-07-22 12:23:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:53,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201368497] [2022-07-22 12:23:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:53,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:53,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:53,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:54,377 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:23:54,378 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:23:54,378 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:23:54,378 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:23:54,378 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:23:54,378 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:54,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:23:54,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:23:54,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-min-le-max.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:23:54,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:23:54,379 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:23:54,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:54,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:55,388 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:23:55,393 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:23:55,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,400 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:23:55,401 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:23:55,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:55,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:55,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:55,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:23:55,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,457 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:23:55,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:23:55,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:55,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:55,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:55,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,540 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:23:55,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,542 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:23:55,546 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:23:55,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:55,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:55,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,609 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:23:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,611 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:23:55,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:55,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:55,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:55,628 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:23:55,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,662 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:23:55,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,666 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:23:55,668 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:23:55,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:55,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:55,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:55,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,703 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:23:55,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,707 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:23:55,712 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:23:55,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:55,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:55,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:55,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,748 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:23:55,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,750 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:23:55,750 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:23:55,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:55,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:55,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:55,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-22 12:23:55,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,785 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:23:55,791 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:23:55,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:55,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:55,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:55,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-22 12:23:55,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,845 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:23:55,845 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:23:55,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:55,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:55,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:55,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,885 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:23:55,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,886 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:23:55,887 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:23:55,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:55,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:55,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:55,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:55,928 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:23:55,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:55,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:55,930 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:23:55,930 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:23:55,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:55,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:55,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:55,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:55,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:55,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:55,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:55,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:56,005 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:23:56,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:56,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:56,007 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:23:56,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:56,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:56,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:56,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:56,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:56,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:56,021 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:23:56,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:56,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:56,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:56,043 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:23:56,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:56,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:56,045 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:23:56,046 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:23:56,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:56,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:56,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:56,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:56,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:56,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:56,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:56,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:56,118 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:23:56,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:56,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:56,119 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:23:56,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:56,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:56,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:56,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:56,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:56,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:56,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:56,125 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:23:56,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:56,186 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:23:56,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:56,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:56,188 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:23:56,190 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:23:56,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:56,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:56,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:56,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:56,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:56,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:56,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:56,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:56,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 12:23:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:56,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:56,230 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:23:56,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting 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:23:56,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:56,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:56,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:56,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:56,249 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:23:56,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:56,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:56,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:23:56,312 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-22 12:23:56,313 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:23:56,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:56,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:56,316 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:23:56,320 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:23:56,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:23:56,343 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:23:56,343 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:23:56,344 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~2#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 Supporting invariants [1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset >= 0] [2022-07-22 12:23:56,382 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:23:56,496 INFO L257 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-07-22 12:23:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:56,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 12:23:56,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:56,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:23:56,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:56,609 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:23:56,671 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:23:56,674 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 80 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:23:56,736 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 80 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 82 states and 218 transitions. Complement of second has 3 states. [2022-07-22 12:23:56,739 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:23:56,744 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:23:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:23:56,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:23:56,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:56,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:23:56,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:56,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:23:56,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:56,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 218 transitions. [2022-07-22 12:23:56,754 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 36 [2022-07-22 12:23:56,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 66 states and 182 transitions. [2022-07-22 12:23:56,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2022-07-22 12:23:56,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-07-22 12:23:56,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 182 transitions. [2022-07-22 12:23:56,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:56,765 INFO L220 hiAutomatonCegarLoop]: Abstraction has 66 states and 182 transitions. [2022-07-22 12:23:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 182 transitions. [2022-07-22 12:23:56,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-22 12:23:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.757575757575758) internal successors, (182), 65 states have internal predecessors, (182), 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:23:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 182 transitions. [2022-07-22 12:23:56,805 INFO L242 hiAutomatonCegarLoop]: Abstraction has 66 states and 182 transitions. [2022-07-22 12:23:56,805 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 182 transitions. [2022-07-22 12:23:56,805 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:23:56,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 182 transitions. [2022-07-22 12:23:56,807 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 36 [2022-07-22 12:23:56,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:56,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:56,808 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:23:56,808 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:56,809 INFO L748 eck$LassoCheckResult]: Stem: 629#[ULTIMATE.startENTRY]don't care [546] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse2 (store |v_#valid_251| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_160| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_61| 1))) (and (< 0 |v_#StackHeapBarrier_42|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|) (= (select |v_#length_202| 2) 29) (= 48 (select .cse0 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_62| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_58| 0) (= |v_#NULL.base_12| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_121| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_249|) (= v_~max~0_85 0) (= (store (store (store (store |v_#length_202| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_61| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|)) |v_#length_200|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| v_~N~0_89) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_61|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= v_~min~0_109 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_49| 0) (= (select |v_#length_202| 1) 2) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_121| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= v_~A~0.offset_105 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_61|) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_251| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_251| 1) 1) (= v_~v_assert~0_42 0) (= (select |v_#valid_251| 0) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_53| 0) (= (select |v_#valid_251| 2) 1))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_251|, #memory_int=|v_#memory_int_160|, #length=|v_#length_202|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_53|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_18|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, ~max~0=v_~max~0_85, #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_38|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_121|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_18|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_39|, #length=|v_#length_200|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_58|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, 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_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~N~0=v_~N~0_89, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_32|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_62|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_37|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_17|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_32|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_38|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_15|, ~v_assert~0=v_~v_assert~0_42, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ~A~0.offset=v_~A~0.offset_105, #valid=|v_#valid_249|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_42|, ~min~0=v_~min~0_109, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_43|, #memory_int=|v_#memory_int_160|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#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, ~max~0, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem10#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~v_assert~0, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ~min~0, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 631#[L108-6]don't care [545] L108-6-->L90-3: Formula: (let ((.cse0 (select (select |v_#memory_int_In_5| v_~A~0.base_Out_2) v_~A~0.offset_Out_2))) (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|) (<= 0 v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10| v_~A~0.offset_Out_2) (= v_~max~0_Out_6 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= (select |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre11#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 1 (select |v_#valid_In_9| v_~A~0.base_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_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre11#1_Out_2|))) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_9| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (< 0 v_~N~0_In_5) 1 0)) (= .cse0 v_~min~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10| v_~A~0.base_Out_2))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_9|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_9|, ~N~0=v_~N~0_In_5, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|} OutVars{~A~0.base=v_~A~0.base_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|, ~max~0=v_~max~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, #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~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_Out_2|, #length=|v_#length_In_9|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_In_9|, ~min~0=v_~min~0_Out_6, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_#t~pre11#1, ~max~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~min~0, #memory_int, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 615#[L90-3]don't care [393] L90-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 519#[L90-4, thread1ENTRY]don't care [368] thread1ENTRY-->L47-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 523#[L90-4, L47-4]don't care [2022-07-22 12:23:56,810 INFO L750 eck$LassoCheckResult]: Loop: 523#[L90-4, L47-4]don't care [521] L47-4-->L47-4: Formula: (let ((.cse3 (* v_thread1Thread1of1ForFork0_~i~0_40 4))) (let ((.cse2 (+ v_~A~0.offset_79 .cse3))) (and (let ((.cse1 (select (select |v_#memory_int_130| v_~A~0.base_79) .cse2))) (let ((.cse0 (< .cse1 v_~min~0_82))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_44| |v_thread1Thread1of1ForFork0_#t~mem3_43|) (= v_~min~0_82 v_~min~0_81) (not .cse0)) (and (= .cse1 v_~min~0_81) .cse0)))) (= (+ v_thread1Thread1of1ForFork0_~i~0_40 1) v_thread1Thread1of1ForFork0_~i~0_39) (= (select |v_#valid_191| v_~A~0.base_79) 1) (<= 0 .cse2) (<= (+ v_~A~0.offset_79 .cse3 4) (select |v_#length_152| v_~A~0.base_79)) (< v_thread1Thread1of1ForFork0_~i~0_40 v_~N~0_59)))) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_44|, ~min~0=v_~min~0_82, #valid=|v_#valid_191|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_40, #memory_int=|v_#memory_int_130|, #length=|v_#length_152|, ~N~0=v_~N~0_59} OutVars{~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_23|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_43|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, ~min~0=v_~min~0_81, #valid=|v_#valid_191|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_39, #memory_int=|v_#memory_int_130|, #length=|v_#length_152|, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, ~min~0, thread1Thread1of1ForFork0_~i~0] 523#[L90-4, L47-4]don't care [2022-07-22 12:23:56,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash 17725703, now seen corresponding path program 1 times [2022-07-22 12:23:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:56,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134005073] [2022-07-22 12:23:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:56,905 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:23:56,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:56,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134005073] [2022-07-22 12:23:56,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134005073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:23:56,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:23:56,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:23:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47039023] [2022-07-22 12:23:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:23:56,910 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:23:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:56,910 INFO L85 PathProgramCache]: Analyzing trace with hash 552, now seen corresponding path program 1 times [2022-07-22 12:23:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:56,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722891466] [2022-07-22 12:23:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:56,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:56,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:23:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:23:57,022 INFO L87 Difference]: Start difference. First operand 66 states and 182 transitions. cyclomatic complexity: 153 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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:23:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:57,082 INFO L93 Difference]: Finished difference Result 66 states and 181 transitions. [2022-07-22 12:23:57,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 181 transitions. [2022-07-22 12:23:57,091 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 36 [2022-07-22 12:23:57,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 181 transitions. [2022-07-22 12:23:57,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-07-22 12:23:57,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-07-22 12:23:57,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 181 transitions. [2022-07-22 12:23:57,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:57,103 INFO L220 hiAutomatonCegarLoop]: Abstraction has 66 states and 181 transitions. [2022-07-22 12:23:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 181 transitions. [2022-07-22 12:23:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-22 12:23:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.742424242424242) internal successors, (181), 65 states have internal predecessors, (181), 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:23:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 181 transitions. [2022-07-22 12:23:57,123 INFO L242 hiAutomatonCegarLoop]: Abstraction has 66 states and 181 transitions. [2022-07-22 12:23:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:23:57,124 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 181 transitions. [2022-07-22 12:23:57,124 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:23:57,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 181 transitions. [2022-07-22 12:23:57,129 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 36 [2022-07-22 12:23:57,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:57,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:57,130 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:23:57,130 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:57,131 INFO L748 eck$LassoCheckResult]: Stem: 833#[ULTIMATE.startENTRY]don't care [546] ULTIMATE.startENTRY-->L108-6: Formula: (let ((.cse2 (store |v_#valid_251| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57| 1))) (let ((.cse0 (select |v_#memory_int_160| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_61| 1))) (and (< 0 |v_#StackHeapBarrier_42|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|) (= (select |v_#length_202| 2) 29) (= 48 (select .cse0 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_62| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t2~0#1.base_57|) (= v_~A~0.base_105 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_58| 0) (= |v_#NULL.base_12| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_121| 0)) (= (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 1) |v_#valid_249|) (= v_~max~0_85 0) (= (store (store (store (store |v_#length_202| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_57| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_61| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|)) |v_#length_200|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_57|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| v_~N~0_89) (< |v_#StackHeapBarrier_42| |v_ULTIMATE.start_main_~#t3~0#1.base_61|) (= (select .cse0 1) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53| 0) (= v_~min~0_109 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53|) 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_62|) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_49| 0) (= (select |v_#length_202| 1) 2) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_121| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_53| |v_#StackHeapBarrier_42|) (= v_~A~0.offset_105 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_47| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_61|) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#valid_251| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select |v_#valid_251| 1) 1) (= v_~v_assert~0_42 0) (= (select |v_#valid_251| 0) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_53| 0) (= (select |v_#valid_251| 2) 1))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_42|, #valid=|v_#valid_251|, #memory_int=|v_#memory_int_160|, #length=|v_#length_202|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_53|, ~A~0.base=v_~A~0.base_105, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_31|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_53|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_18|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_61|, ~max~0=v_~max~0_85, #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_38|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_47|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_19|, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base_43|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_121|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_18|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_39|, #length=|v_#length_200|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_58|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_33|, 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_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~N~0=v_~N~0_89, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_32|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_62|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_37|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_17|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_32|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_38|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_15|, ~v_assert~0=v_~v_assert~0_42, #StackHeapBarrier=|v_#StackHeapBarrier_42|, ~A~0.offset=v_~A~0.offset_105, #valid=|v_#valid_249|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_42|, ~min~0=v_~min~0_109, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset_43|, #memory_int=|v_#memory_int_160|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_57|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#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, ~max~0, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~mem9#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_main_#t~mem10#1, #NULL.base, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ~v_assert~0, ~A~0.offset, #valid, ULTIMATE.start_main_#t~nondet7#1, ~min~0, ULTIMATE.start_create_fresh_int_array_#t~malloc20#1.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 835#[L108-6]don't care [518] L108-6-->L108-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|))) (and (= (select |v_#valid_181| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_42|) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29| 4) (select |v_#length_142| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 1)) (<= 0 .cse1) (= (store |v_#memory_int_115| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29| (store (select |v_#memory_int_115| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_19|)) |v_#memory_int_114|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_181|, #memory_int=|v_#memory_int_115|, #length=|v_#length_142|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33|, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet22#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_181|, #memory_int=|v_#memory_int_114|, #length=|v_#length_142|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_23|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_42|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet22#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1] 839#[L108-6]don't care [545] L108-6-->L90-3: Formula: (let ((.cse0 (select (select |v_#memory_int_In_5| v_~A~0.base_Out_2) v_~A~0.offset_Out_2))) (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|) (<= 0 v_~A~0.offset_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10| v_~A~0.offset_Out_2) (= v_~max~0_Out_6 .cse0) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|)) (= (select |v_#valid_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre11#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_9| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= 1 (select |v_#valid_In_9| v_~A~0.base_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_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_5| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre11#1_Out_2|))) (<= (+ 4 v_~A~0.offset_Out_2) (select |v_#length_In_9| v_~A~0.base_Out_2)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (< 0 v_~N~0_In_5) 1 0)) (= .cse0 v_~min~0_Out_6) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10| v_~A~0.base_Out_2))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, #valid=|v_#valid_In_9|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_9|, ~N~0=v_~N~0_In_5, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|} OutVars{~A~0.base=v_~A~0.base_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|, ~max~0=v_~max~0_Out_6, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, #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~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_Out_2|, #length=|v_#length_In_9|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_5|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, ~A~0.offset=v_~A~0.offset_Out_2, #valid=|v_#valid_In_9|, ~min~0=v_~min~0_Out_6, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_main_#t~pre11#1, ~max~0, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ~min~0, #memory_int, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 819#[L90-3]don't care [393] L90-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_4|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_6|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 723#[L90-4, thread1ENTRY]don't care [368] thread1ENTRY-->L47-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 727#[L90-4, L47-4]don't care [2022-07-22 12:23:57,131 INFO L750 eck$LassoCheckResult]: Loop: 727#[L90-4, L47-4]don't care [521] L47-4-->L47-4: Formula: (let ((.cse3 (* v_thread1Thread1of1ForFork0_~i~0_40 4))) (let ((.cse2 (+ v_~A~0.offset_79 .cse3))) (and (let ((.cse1 (select (select |v_#memory_int_130| v_~A~0.base_79) .cse2))) (let ((.cse0 (< .cse1 v_~min~0_82))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_44| |v_thread1Thread1of1ForFork0_#t~mem3_43|) (= v_~min~0_82 v_~min~0_81) (not .cse0)) (and (= .cse1 v_~min~0_81) .cse0)))) (= (+ v_thread1Thread1of1ForFork0_~i~0_40 1) v_thread1Thread1of1ForFork0_~i~0_39) (= (select |v_#valid_191| v_~A~0.base_79) 1) (<= 0 .cse2) (<= (+ v_~A~0.offset_79 .cse3 4) (select |v_#length_152| v_~A~0.base_79)) (< v_thread1Thread1of1ForFork0_~i~0_40 v_~N~0_59)))) InVars {~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_44|, ~min~0=v_~min~0_82, #valid=|v_#valid_191|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_40, #memory_int=|v_#memory_int_130|, #length=|v_#length_152|, ~N~0=v_~N~0_59} OutVars{~A~0.base=v_~A~0.base_79, ~A~0.offset=v_~A~0.offset_79, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_23|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_43|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_21|, ~min~0=v_~min~0_81, #valid=|v_#valid_191|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_39, #memory_int=|v_#memory_int_130|, #length=|v_#length_152|, ~N~0=v_~N~0_59} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, ~min~0, thread1Thread1of1ForFork0_~i~0] 727#[L90-4, L47-4]don't care [2022-07-22 12:23:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:57,132 INFO L85 PathProgramCache]: Analyzing trace with hash 548839651, now seen corresponding path program 1 times [2022-07-22 12:23:57,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:57,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412981585] [2022-07-22 12:23:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:57,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:57,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:57,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 552, now seen corresponding path program 2 times [2022-07-22 12:23:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:57,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014104523] [2022-07-22 12:23:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:57,250 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:57,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:57,257 INFO L85 PathProgramCache]: Analyzing trace with hash -165839482, now seen corresponding path program 1 times [2022-07-22 12:23:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:57,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228924915] [2022-07-22 12:23:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:57,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:57,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:58,018 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:23:59,478 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:23:59,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:23:59,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:23:59,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:23:59,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:23:59,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:59,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:23:59,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:23:59,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-min-le-max.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:23:59,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:23:59,479 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:23:59,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:59,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:24:00,474 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:24:00,477 INFO L158 Benchmark]: Toolchain (without parser) took 14509.18ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 130.6MB in the beginning and 87.2MB in the end (delta: 43.3MB). Peak memory consumption was 143.1MB. Max. memory is 8.0GB. [2022-07-22 12:24:00,478 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 157.3MB. Free memory was 126.7MB in the beginning and 126.3MB in the end (delta: 440.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:24:00,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.15ms. Allocated memory is still 157.3MB. Free memory was 130.3MB in the beginning and 119.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:24:00,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.30ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 117.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:24:00,480 INFO L158 Benchmark]: Boogie Preprocessor took 35.28ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 116.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:24:00,481 INFO L158 Benchmark]: RCFGBuilder took 798.45ms. Allocated memory is still 157.3MB. Free memory was 116.1MB in the beginning and 138.1MB in the end (delta: -22.0MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. [2022-07-22 12:24:00,482 INFO L158 Benchmark]: BuchiAutomizer took 13198.16ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 138.1MB in the beginning and 87.2MB in the end (delta: 50.8MB). Peak memory consumption was 149.9MB. Max. memory is 8.0GB. [2022-07-22 12:24:00,485 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.32ms. Allocated memory is still 157.3MB. Free memory was 126.7MB in the beginning and 126.3MB in the end (delta: 440.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 422.15ms. Allocated memory is still 157.3MB. Free memory was 130.3MB in the beginning and 119.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.30ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 117.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.28ms. Allocated memory is still 157.3MB. Free memory was 117.8MB in the beginning and 116.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 798.45ms. Allocated memory is still 157.3MB. Free memory was 116.1MB in the beginning and 138.1MB in the end (delta: -22.0MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 13198.16ms. Allocated memory was 157.3MB in the beginning and 255.9MB in the end (delta: 98.6MB). Free memory was 138.1MB in the beginning and 87.2MB in the end (delta: 50.8MB). Peak memory consumption was 149.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 143 PlacesBefore, 29 PlacesAfterwards, 143 TransitionsBefore, 22 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 7 FixpointIterations, 94 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 144 TotalNumberOfCompositions, 1182 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1020, positive: 995, positive conditional: 0, positive unconditional: 995, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 636, positive: 623, positive conditional: 0, positive unconditional: 623, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 636, positive: 623, positive conditional: 0, positive unconditional: 623, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1020, positive: 372, positive conditional: 0, positive unconditional: 372, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 636, unknown conditional: 0, unknown unconditional: 636] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - 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:24:00,547 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...