/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:41:39,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:41:39,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:41:39,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:41:39,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:41:39,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:41:39,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:41:39,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:41:39,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:41:39,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:41:39,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:41:39,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:41:39,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:41:39,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:41:39,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:41:39,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:41:39,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:41:39,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:41:39,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:41:39,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:41:39,388 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:41:39,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:41:39,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:41:39,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:41:39,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:41:39,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:41:39,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:41:39,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:41:39,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:41:39,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:41:39,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:41:39,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:41:39,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:41:39,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:41:39,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:41:39,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:41:39,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:41:39,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:41:39,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:41:39,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:41:39,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:41:39,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:41:39,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:41:39,458 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:41:39,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:41:39,460 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:41:39,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:41:39,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:41:39,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:41:39,463 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:41:39,463 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:41:39,463 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:41:39,464 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:41:39,465 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:41:39,465 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:41:39,465 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:41:39,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:41:39,465 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:41:39,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:41:39,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:41:39,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:41:39,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:41:39,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:41:39,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:41:39,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:41:39,467 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:41:39,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:41:39,468 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:41:39,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:41:39,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:41:39,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:41:39,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:41:39,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:41:39,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:41:39,470 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:41:39,472 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:41:39,472 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:41:39,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:41:39,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:41:39,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:41:39,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:41:39,943 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:41:39,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2022-07-22 12:41:40,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56bf8499/5b6c5d87a2064fb48b39e1a264190757/FLAGba41f136b [2022-07-22 12:41:40,763 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:41:40,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2022-07-22 12:41:40,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56bf8499/5b6c5d87a2064fb48b39e1a264190757/FLAGba41f136b [2022-07-22 12:41:41,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a56bf8499/5b6c5d87a2064fb48b39e1a264190757 [2022-07-22 12:41:41,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:41:41,098 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:41:41,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:41:41,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:41:41,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:41:41,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4211c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41, skipping insertion in model container [2022-07-22 12:41:41,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:41:41,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:41:41,331 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/chl-array-int-symm.wvr.c[2482,2495] [2022-07-22 12:41:41,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:41:41,361 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:41:41,387 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/chl-array-int-symm.wvr.c[2482,2495] [2022-07-22 12:41:41,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:41:41,424 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:41:41,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41 WrapperNode [2022-07-22 12:41:41,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:41:41,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:41:41,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:41:41,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:41:41,436 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:41:41" (1/1) ... [2022-07-22 12:41:41,445 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:41:41" (1/1) ... [2022-07-22 12:41:41,479 INFO L137 Inliner]: procedures = 25, calls = 39, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 192 [2022-07-22 12:41:41,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:41:41,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:41:41,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:41:41,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:41:41,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:41:41,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:41:41,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:41:41,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:41:41,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (1/1) ... [2022-07-22 12:41:41,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:41,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:41,578 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:41:41,590 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:41:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:41:41,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:41:41,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:41:41,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:41:41,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:41:41,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:41:41,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:41:41,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:41:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:41:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:41:41,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:41:41,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:41:41,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:41:41,652 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:41:41,821 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:41:41,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:41:42,353 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:41:42,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:41:42,369 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:41:42,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:41:42 BoogieIcfgContainer [2022-07-22 12:41:42,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:41:42,374 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:41:42,374 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:41:42,379 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:41:42,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:41:42,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:41:41" (1/3) ... [2022-07-22 12:41:42,382 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5910573b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:41:42, skipping insertion in model container [2022-07-22 12:41:42,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:41:42,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:41:41" (2/3) ... [2022-07-22 12:41:42,383 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5910573b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:41:42, skipping insertion in model container [2022-07-22 12:41:42,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:41:42,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:41:42" (3/3) ... [2022-07-22 12:41:42,385 INFO L322 chiAutomizerObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2022-07-22 12:41:42,525 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:41:42,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 237 places, 253 transitions, 522 flow [2022-07-22 12:41:42,693 INFO L129 PetriNetUnfolder]: 21/249 cut-off events. [2022-07-22 12:41:42,694 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:41:42,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 21/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 334 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 160. Up to 3 conditions per place. [2022-07-22 12:41:42,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 253 transitions, 522 flow [2022-07-22 12:41:42,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 249 transitions, 510 flow [2022-07-22 12:41:42,732 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:41:42,744 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 249 transitions, 510 flow [2022-07-22 12:41:42,747 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 249 transitions, 510 flow [2022-07-22 12:41:42,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 235 places, 249 transitions, 510 flow [2022-07-22 12:41:42,806 INFO L129 PetriNetUnfolder]: 21/249 cut-off events. [2022-07-22 12:41:42,806 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:41:42,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 21/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 343 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 160. Up to 3 conditions per place. [2022-07-22 12:41:42,815 INFO L116 LiptonReduction]: Number of co-enabled transitions 6272 [2022-07-22 12:41:51,081 INFO L131 LiptonReduction]: Checked pairs total: 6670 [2022-07-22 12:41:51,081 INFO L133 LiptonReduction]: Total number of compositions: 287 [2022-07-22 12:41:51,105 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:41:51,105 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:41:51,106 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:41:51,106 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:41:51,106 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:41:51,106 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:41:51,106 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:41:51,106 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:41:51,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:41:51,159 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 28 [2022-07-22 12:41:51,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:41:51,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:41:51,166 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:41:51,167 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:41:51,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:41:51,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 59 states, but on-demand construction may add more states [2022-07-22 12:41:51,174 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 28 [2022-07-22 12:41:51,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:41:51,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:41:51,175 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:41:51,175 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:41:51,181 INFO L748 eck$LassoCheckResult]: Stem: 240#[ULTIMATE.startENTRY]don't care [982] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse1 (store |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_131| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) (= (select .cse0 0) 48) (= (select |v_#valid_239| 2) 1) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (= (select |v_#length_204| 2) 25) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| |v_#StackHeapBarrier_52|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|) (= v_~res2~0_65 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201| 0)) (= (select |v_#valid_239| 1) 1) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~res1~0_63 0) (= v_~a2~0.base_73 0) (= v_~a2~0.offset_73 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 1) |v_#valid_238|) (= |v_#NULL.offset_8| 0) (= v_~a1~0.base_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113| 0) (= |v_#NULL.base_8| 0) (= (select .cse0 1) 0) (= (select |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| v_~n1~0_66) (= 0 v_~a1~0.offset_61) (= (select |v_#valid_239| 0) 0) (= (select |v_#length_204| 1) 2) (= (store (store (store |v_#length_204| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_203|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_239|, #memory_int=|v_#memory_int_131|, #length=|v_#length_204|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_85|, ~res1~0=v_~res1~0_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~n1~0=v_~n1~0_66, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ~a1~0.base=v_~a1~0.base_61, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_20|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|, ~a2~0.base=v_~a2~0.base_73, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_85|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_24|, #length=|v_#length_203|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_65|, ~a2~0.offset=v_~a2~0.offset_73, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_32|, ~res2~0=v_~res2~0_65, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|, ~n2~0=v_~n2~0_74, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_26|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_51|, #valid=|v_#valid_238|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, ~a1~0.offset=v_~a1~0.offset_61, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_63|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ~n1~0, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~pre19#1, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ~a2~0.offset, ULTIMATE.start_main_#t~mem22#1, ~res2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_main_#t~nondet20#1, ~a1~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 243#[L102-6]don't care [2022-07-22 12:41:51,182 INFO L750 eck$LassoCheckResult]: Loop: 243#[L102-6]don't care [943] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_77|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69| (store (select |v_#memory_int_104| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_48|)) |v_#memory_int_103|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (<= 0 .cse0) (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_104|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_48|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_103|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_77|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1] 243#[L102-6]don't care [2022-07-22 12:41:51,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:51,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1013, now seen corresponding path program 1 times [2022-07-22 12:41:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:51,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134325905] [2022-07-22 12:41:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:51,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:51,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:51,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash 974, now seen corresponding path program 1 times [2022-07-22 12:41:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:51,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457756272] [2022-07-22 12:41:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:51,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:51,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:51,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash 32346, now seen corresponding path program 1 times [2022-07-22 12:41:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:51,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362067063] [2022-07-22 12:41:51,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:51,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:51,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:52,206 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:41:52,206 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:41:52,207 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:41:52,207 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:41:52,207 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:41:52,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:52,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:41:52,207 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:41:52,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-array-int-symm.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:41:52,208 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:41:52,208 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:41:52,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:52,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:53,037 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:41:53,044 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:41:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,052 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:41:53,061 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:41:53,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,081 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:41:53,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:53,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,134 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:41:53,146 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:41:53,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,163 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:41:53,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,207 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:41:53,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,209 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:41:53,211 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:41:53,212 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:41:53,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:53,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:53,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:53,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,265 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:41:53,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,267 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:41:53,267 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:41:53,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:53,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:53,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:53,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:53,278 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,300 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:41:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,302 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:41:53,307 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:41:53,308 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:41:53,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:53,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:53,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:53,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,352 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:41:53,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,353 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:41:53,355 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:41:53,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:53,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,432 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:41:53,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,434 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:41:53,436 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:41:53,443 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:41:53,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:53,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,511 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:41:53,514 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:41:53,516 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:41:53,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,577 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:41:53,586 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:41:53,587 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:41:53,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 12:41:53,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,633 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:41:53,634 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:41:53,635 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:41:53,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,694 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:41:53,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,696 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:41:53,703 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:41:53,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:53,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:53,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:53,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:53,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,761 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:41:53,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,762 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:41:53,763 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:41:53,764 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:41:53,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,807 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:41:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,809 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:41:53,809 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:41:53,810 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:41:53,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,885 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:41:53,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,887 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:41:53,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:53,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,908 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:41:53,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:53,951 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:41:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:53,953 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:41:53,960 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:41:53,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:53,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:53,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:53,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:53,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:53,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:53,975 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:41:53,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:54,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:54,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:54,021 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:41:54,024 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:41:54,024 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:41:54,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:54,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:54,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:54,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:54,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:54,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:54,060 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:54,097 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:41:54,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:54,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:54,099 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:41:54,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:54,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:54,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:54,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:54,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:54,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:54,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:54,124 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:41:54,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:54,168 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:41:54,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:54,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:54,169 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:54,177 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:41:54,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:54,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:54,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:54,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:54,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:54,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:54,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:41:54,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:54,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:54,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:54,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:54,255 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:54,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:41:54,267 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:41:54,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:54,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:54,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:54,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:54,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:54,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:54,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:54,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:54,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:54,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:54,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:54,308 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:54,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:41:54,310 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:41:54,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:54,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:54,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:54,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:54,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:54,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:54,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:41:54,368 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:41:54,368 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:41:54,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:54,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:54,378 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:54,387 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:41:54,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:41:54,410 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:41:54,410 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:41:54,411 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, 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*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 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 [] [2022-07-22 12:41:54,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:54,540 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:41:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:41:54,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:41:54,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:41:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:41:54,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:41:54,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:41:54,651 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:41:54,697 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:41:54,700 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 59 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:41:54,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 59 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 62 states and 146 transitions. Complement of second has 3 states. [2022-07-22 12:41:54,764 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:41:54,770 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:41:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:41:54,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:41:54,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:41:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:41:54,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:41:54,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:41:54,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:41:54,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 146 transitions. [2022-07-22 12:41:54,786 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 27 [2022-07-22 12:41:54,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 52 states and 123 transitions. [2022-07-22 12:41:54,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-07-22 12:41:54,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-07-22 12:41:54,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 123 transitions. [2022-07-22 12:41:54,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:41:54,802 INFO L220 hiAutomatonCegarLoop]: Abstraction has 52 states and 123 transitions. [2022-07-22 12:41:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 123 transitions. [2022-07-22 12:41:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-07-22 12:41:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.372549019607843) internal successors, (121), 50 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:41:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 121 transitions. [2022-07-22 12:41:54,835 INFO L242 hiAutomatonCegarLoop]: Abstraction has 51 states and 121 transitions. [2022-07-22 12:41:54,835 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 121 transitions. [2022-07-22 12:41:54,836 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:41:54,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 121 transitions. [2022-07-22 12:41:54,837 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 27 [2022-07-22 12:41:54,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:41:54,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:41:54,838 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:41:54,838 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:41:54,839 INFO L748 eck$LassoCheckResult]: Stem: 601#[ULTIMATE.startENTRY]don't care [982] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse1 (store |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_131| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) (= (select .cse0 0) 48) (= (select |v_#valid_239| 2) 1) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (= (select |v_#length_204| 2) 25) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| |v_#StackHeapBarrier_52|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|) (= v_~res2~0_65 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201| 0)) (= (select |v_#valid_239| 1) 1) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~res1~0_63 0) (= v_~a2~0.base_73 0) (= v_~a2~0.offset_73 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 1) |v_#valid_238|) (= |v_#NULL.offset_8| 0) (= v_~a1~0.base_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113| 0) (= |v_#NULL.base_8| 0) (= (select .cse0 1) 0) (= (select |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| v_~n1~0_66) (= 0 v_~a1~0.offset_61) (= (select |v_#valid_239| 0) 0) (= (select |v_#length_204| 1) 2) (= (store (store (store |v_#length_204| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_203|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_239|, #memory_int=|v_#memory_int_131|, #length=|v_#length_204|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_85|, ~res1~0=v_~res1~0_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~n1~0=v_~n1~0_66, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ~a1~0.base=v_~a1~0.base_61, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_20|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|, ~a2~0.base=v_~a2~0.base_73, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_85|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_24|, #length=|v_#length_203|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_65|, ~a2~0.offset=v_~a2~0.offset_73, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_32|, ~res2~0=v_~res2~0_65, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|, ~n2~0=v_~n2~0_74, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_26|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_51|, #valid=|v_#valid_238|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, ~a1~0.offset=v_~a1~0.offset_61, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_63|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ~n1~0, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~pre19#1, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ~a2~0.offset, ULTIMATE.start_main_#t~mem22#1, ~res2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_main_#t~nondet20#1, ~a1~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 553#[L102-6]don't care [981] L102-6-->L102-14: Formula: (and (= |v_#valid_Out_14| (store |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5| v_~a1~0.base_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5| v_~a1~0.offset_Out_2) (= (select |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_10| (store |v_#length_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= v_~n2~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #valid=|v_#valid_In_9|, #length=|v_#length_In_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ~a1~0.base=v_~a1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_Out_10|, #valid=|v_#valid_Out_14|, ~a1~0.offset=v_~a1~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_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[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, ~a1~0.offset, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 555#[L102-14]don't care [2022-07-22 12:41:54,839 INFO L750 eck$LassoCheckResult]: Loop: 555#[L102-14]don't care [918] L102-14-->L102-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_71|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66| 1)) (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_38|))) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) 1) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4 .cse1) (select |v_#length_137| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_94|, #length=|v_#length_137|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_71|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_93|, #length=|v_#length_137|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_65|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_39|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_71|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1] 555#[L102-14]don't care [2022-07-22 12:41:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash 32384, now seen corresponding path program 1 times [2022-07-22 12:41:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:54,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653169493] [2022-07-22 12:41:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:54,877 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:54,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash 949, now seen corresponding path program 1 times [2022-07-22 12:41:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:54,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264443822] [2022-07-22 12:41:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:54,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:54,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:54,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1004822, now seen corresponding path program 1 times [2022-07-22 12:41:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:54,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298559252] [2022-07-22 12:41:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:55,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:55,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:56,489 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:41:56,489 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:41:56,489 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:41:56,489 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:41:56,489 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:41:56,489 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:56,490 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:41:56,490 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:41:56,490 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-array-int-symm.wvr.c_BEv2_Iteration2_Lasso [2022-07-22 12:41:56,490 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:41:56,490 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:41:56,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,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:41:56,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:41:56,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:41:56,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:41:56,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,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:41:56,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:41:56,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,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:41:56,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,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:41:56,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:41:56,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:56,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:41:57,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:41:57,572 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:41:57,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,574 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,580 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:41:57,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:57,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:57,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:41:57,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,640 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,642 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:41:57,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:57,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:57,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:57,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:41:57,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,697 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,700 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:41:57,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:57,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:57,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:57,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:41:57,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,757 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:57,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:57,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:57,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:41:57,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,830 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:41:57,833 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:41:57,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:57,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:57,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:57,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,878 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,880 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:41:57,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:41:57,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:57,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:57,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:57,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,915 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,916 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:41:57,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:41:57,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:57,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:57,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:57,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:41:57,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:57,962 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:57,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:41:57,964 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:41:57,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:57,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:57,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:57,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:57,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:57,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:57,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:57,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:57,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:57,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,001 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:41:58,002 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:41:58,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:41:58,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,039 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:41:58,040 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:41:58,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:58,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:58,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:58,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:41:58,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,075 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,086 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:41:58,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:41:58,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,145 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,148 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:41:58,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:41:58,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,214 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,218 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:41:58,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:58,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:58,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:58,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:41:58,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,275 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,278 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:41:58,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:58,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:58,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:58,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:41:58,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,334 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,342 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:41:58,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:41:58,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,400 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:58,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:58,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:58,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:58,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:41:58,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,455 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:58,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:41:58,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 12:41:58,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,514 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:41:58,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:58,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,564 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:41:58,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:58,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,614 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:41:58,618 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:41:58,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-22 12:41:58,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,653 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:41:58,655 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:41:58,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:58,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:58,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:58,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-22 12:41:58,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,688 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,690 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:41:58,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:41:58,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:58,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,699 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:58,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:58,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,737 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:41:58,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:58,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:58,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:58,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:58,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-22 12:41:58,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,772 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:41:58,773 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:41:58,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,781 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-07-22 12:41:58,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,785 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-22 12:41:58,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-22 12:41:58,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,818 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 12:41:58,821 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:41:58,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,881 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 12:41:58,883 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:41:58,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,894 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:58,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,919 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 12:41:58,920 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:41:58,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:58,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 12:41:58,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:58,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:58,967 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:58,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 12:41:58,970 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:41:58,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:58,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:58,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:58,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:58,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:58,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:58,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:59,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,027 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:59,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 12:41:59,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,097 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,100 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:41:59,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 12:41:59,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 12:41:59,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,159 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 12:41:59,162 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:41:59,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 12:41:59,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,198 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 12:41:59,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:59,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:59,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:59,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:59,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-22 12:41:59,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,231 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 12:41:59,232 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:41:59,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-22 12:41:59,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,271 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 12:41:59,273 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:41:59,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:41:59,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:41:59,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:41:59,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 12:41:59,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,306 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 12:41:59,307 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:41:59,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-22 12:41:59,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,342 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 12:41:59,344 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:41:59,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:59,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,379 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 12:41:59,381 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:41:59,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 12:41:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,418 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 12:41:59,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:59,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 12:41:59,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,455 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 12:41:59,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:59,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 12:41:59,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,500 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:41:59,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 12:41:59,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:41:59,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 12:41:59,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,552 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 12:41:59,554 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:41:59,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:41:59,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:41:59,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:41:59,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:41:59,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:41:59,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:41:59,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:41:59,593 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:41:59,594 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-22 12:41:59,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:41:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:41:59,595 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:41:59,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 12:41:59,596 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:41:59,604 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:41:59,604 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:41:59,604 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:41:59,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 12:41:59,702 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:41:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:41:59,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:41:59,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:41:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:41:59,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:41:59,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:41:59,751 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:41:59,752 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:41:59,752 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 121 transitions. cyclomatic complexity: 90 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:41:59,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 121 transitions. cyclomatic complexity: 90. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 52 states and 123 transitions. Complement of second has 3 states. [2022-07-22 12:41:59,779 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:41:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:41:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-07-22 12:41:59,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:41:59,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:41:59,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 3 letters. Loop has 1 letters. [2022-07-22 12:41:59,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:41:59,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 12:41:59,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:41:59,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 123 transitions. [2022-07-22 12:41:59,782 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 26 [2022-07-22 12:41:59,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 123 transitions. [2022-07-22 12:41:59,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2022-07-22 12:41:59,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-07-22 12:41:59,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 123 transitions. [2022-07-22 12:41:59,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:41:59,785 INFO L220 hiAutomatonCegarLoop]: Abstraction has 52 states and 123 transitions. [2022-07-22 12:41:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 123 transitions. [2022-07-22 12:41:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-22 12:41:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.3653846153846154) internal successors, (123), 51 states have internal predecessors, (123), 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:41:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 123 transitions. [2022-07-22 12:41:59,791 INFO L242 hiAutomatonCegarLoop]: Abstraction has 52 states and 123 transitions. [2022-07-22 12:41:59,791 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 123 transitions. [2022-07-22 12:41:59,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:41:59,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 123 transitions. [2022-07-22 12:41:59,793 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 26 [2022-07-22 12:41:59,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:41:59,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:41:59,794 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:41:59,794 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:41:59,795 INFO L748 eck$LassoCheckResult]: Stem: 862#[ULTIMATE.startENTRY]don't care [982] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse1 (store |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_131| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) (= (select .cse0 0) 48) (= (select |v_#valid_239| 2) 1) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (= (select |v_#length_204| 2) 25) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| |v_#StackHeapBarrier_52|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|) (= v_~res2~0_65 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201| 0)) (= (select |v_#valid_239| 1) 1) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~res1~0_63 0) (= v_~a2~0.base_73 0) (= v_~a2~0.offset_73 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 1) |v_#valid_238|) (= |v_#NULL.offset_8| 0) (= v_~a1~0.base_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113| 0) (= |v_#NULL.base_8| 0) (= (select .cse0 1) 0) (= (select |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| v_~n1~0_66) (= 0 v_~a1~0.offset_61) (= (select |v_#valid_239| 0) 0) (= (select |v_#length_204| 1) 2) (= (store (store (store |v_#length_204| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_203|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_239|, #memory_int=|v_#memory_int_131|, #length=|v_#length_204|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_85|, ~res1~0=v_~res1~0_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~n1~0=v_~n1~0_66, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ~a1~0.base=v_~a1~0.base_61, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_20|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|, ~a2~0.base=v_~a2~0.base_73, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_85|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_24|, #length=|v_#length_203|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_65|, ~a2~0.offset=v_~a2~0.offset_73, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_32|, ~res2~0=v_~res2~0_65, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|, ~n2~0=v_~n2~0_74, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_26|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_51|, #valid=|v_#valid_238|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, ~a1~0.offset=v_~a1~0.offset_61, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_63|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ~n1~0, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~pre19#1, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ~a2~0.offset, ULTIMATE.start_main_#t~mem22#1, ~res2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_main_#t~nondet20#1, ~a1~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 812#[L102-6]don't care [981] L102-6-->L102-14: Formula: (and (= |v_#valid_Out_14| (store |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5| v_~a1~0.base_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5| v_~a1~0.offset_Out_2) (= (select |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_10| (store |v_#length_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= v_~n2~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #valid=|v_#valid_In_9|, #length=|v_#length_In_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ~a1~0.base=v_~a1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_Out_10|, #valid=|v_#valid_Out_14|, ~a1~0.offset=v_~a1~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_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[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, ~a1~0.offset, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 814#[L102-14]don't care [944] L102-14-->L84-3: Formula: (and (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_21|)) |v_#memory_int_107|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| v_~a2~0.base_51) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| v_~a2~0.offset_51) (= (select |v_#valid_178| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|) (= |v_ULTIMATE.start_main_#t~pre17#1_21| |v_#pthreadsForks_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_87|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_108|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|, ~a2~0.base=v_~a2~0.base_51, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_21|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_107|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ~a2~0.offset=v_~a2~0.offset_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a2~0.offset, ULTIMATE.start_main_#t~pre17#1] 764#[L84-3]don't care [690] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_8|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_12|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_8|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_8|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_12|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_20|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_18|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 766#[thread1ENTRY, L84-4]don't care [791] thread1ENTRY-->L50-2: Formula: (and (= (+ v_~n1~0_18 (* (- 1) v_~n2~0_18)) v_~res1~0_15) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| 0)) InVars {~n2~0=v_~n2~0_18, ~n1~0=v_~n1~0_18} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_18, ~n1~0=v_~n1~0_18, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] 832#[L50-2, L84-4]don't care [2022-07-22 12:41:59,795 INFO L750 eck$LassoCheckResult]: Loop: 832#[L50-2, L84-4]don't care [783] L50-2-->L51-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_31| 4))) (let ((.cse0 (+ .cse1 v_~a1~0.offset_15))) (and (= (select (select |v_#memory_int_45| v_~a1~0.base_15) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_17|) (= (select |v_#valid_68| v_~a1~0.base_15) 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_31| v_~n1~0_16) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_31| v_~n2~0_16) (<= (+ 4 .cse1 v_~a1~0.offset_15) (select |v_#length_59| v_~a1~0.base_15))))) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_16, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, #valid=|v_#valid_68|, ~a1~0.offset=v_~a1~0.offset_15, #memory_int=|v_#memory_int_45|, #length=|v_#length_59|, ~a1~0.base=v_~a1~0.base_15} OutVars{~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_16, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, #valid=|v_#valid_68|, ~a1~0.offset=v_~a1~0.offset_15, #memory_int=|v_#memory_int_45|, #length=|v_#length_59|, ~a1~0.base=v_~a1~0.base_15, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 828#[L51-1, L84-4]don't care [891] L51-1-->L50-2: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_50| 4))) (let ((.cse0 (+ .cse1 v_~a2~0.offset_35))) (and (= (select |v_#valid_132| v_~a2~0.base_35) 1) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| (+ |v_thread1Thread1of1ForFork0_~i~0#1_50| 1)) (= (select (select |v_#memory_int_75| v_~a2~0.base_35) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_30|) (<= 0 .cse0) (<= (+ .cse1 4 v_~a2~0.offset_35) (select |v_#length_115| v_~a2~0.base_35))))) InVars {~a2~0.base=v_~a2~0.base_35, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_50|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_75|, #length=|v_#length_115|, ~a2~0.offset=v_~a2~0.offset_35, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_30|} OutVars{~a2~0.base=v_~a2~0.base_35, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_15|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_75|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_27|, #length=|v_#length_115|, ~a2~0.offset=v_~a2~0.offset_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem1#1] 832#[L50-2, L84-4]don't care [2022-07-22 12:41:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash 965681109, now seen corresponding path program 1 times [2022-07-22 12:41:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842028024] [2022-07-22 12:41:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:59,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:59,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash 26125, now seen corresponding path program 1 times [2022-07-22 12:41:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:59,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121202572] [2022-07-22 12:41:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:59,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:41:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:41:59,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:41:59,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:41:59,885 INFO L85 PathProgramCache]: Analyzing trace with hash 306634977, now seen corresponding path program 1 times [2022-07-22 12:41:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:41:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581627086] [2022-07-22 12:41:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:41:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:41:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:41:59,977 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:41:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:41:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581627086] [2022-07-22 12:41:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581627086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:41:59,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:41:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:41:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166373866] [2022-07-22 12:41:59,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:42:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:42:00,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:42:00,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:42:00,070 INFO L87 Difference]: Start difference. First operand 52 states and 123 transitions. cyclomatic complexity: 91 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:42:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:42:00,177 INFO L93 Difference]: Finished difference Result 81 states and 180 transitions. [2022-07-22 12:42:00,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 180 transitions. [2022-07-22 12:42:00,180 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 34 [2022-07-22 12:42:00,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 77 states and 172 transitions. [2022-07-22 12:42:00,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2022-07-22 12:42:00,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2022-07-22 12:42:00,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 172 transitions. [2022-07-22 12:42:00,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:42:00,183 INFO L220 hiAutomatonCegarLoop]: Abstraction has 77 states and 172 transitions. [2022-07-22 12:42:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 172 transitions. [2022-07-22 12:42:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-07-22 12:42:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.328358208955224) internal successors, (156), 66 states have internal predecessors, (156), 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:42:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 156 transitions. [2022-07-22 12:42:00,191 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67 states and 156 transitions. [2022-07-22 12:42:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:42:00,192 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 156 transitions. [2022-07-22 12:42:00,192 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:42:00,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 156 transitions. [2022-07-22 12:42:00,194 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 30 [2022-07-22 12:42:00,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:42:00,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:42:00,194 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:42:00,194 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:42:00,195 INFO L748 eck$LassoCheckResult]: Stem: 1069#[ULTIMATE.startENTRY]don't care [982] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse1 (store |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_131| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) (= (select .cse0 0) 48) (= (select |v_#valid_239| 2) 1) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (= (select |v_#length_204| 2) 25) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| |v_#StackHeapBarrier_52|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|) (= v_~res2~0_65 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201| 0)) (= (select |v_#valid_239| 1) 1) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~res1~0_63 0) (= v_~a2~0.base_73 0) (= v_~a2~0.offset_73 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 1) |v_#valid_238|) (= |v_#NULL.offset_8| 0) (= v_~a1~0.base_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113| 0) (= |v_#NULL.base_8| 0) (= (select .cse0 1) 0) (= (select |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| v_~n1~0_66) (= 0 v_~a1~0.offset_61) (= (select |v_#valid_239| 0) 0) (= (select |v_#length_204| 1) 2) (= (store (store (store |v_#length_204| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_203|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_239|, #memory_int=|v_#memory_int_131|, #length=|v_#length_204|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_85|, ~res1~0=v_~res1~0_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~n1~0=v_~n1~0_66, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ~a1~0.base=v_~a1~0.base_61, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_20|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|, ~a2~0.base=v_~a2~0.base_73, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_85|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_24|, #length=|v_#length_203|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_65|, ~a2~0.offset=v_~a2~0.offset_73, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_32|, ~res2~0=v_~res2~0_65, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|, ~n2~0=v_~n2~0_74, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_26|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_51|, #valid=|v_#valid_238|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, ~a1~0.offset=v_~a1~0.offset_61, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_63|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ~n1~0, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~pre19#1, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ~a2~0.offset, ULTIMATE.start_main_#t~mem22#1, ~res2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_main_#t~nondet20#1, ~a1~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1007#[L102-6]don't care [943] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_77|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69| (store (select |v_#memory_int_104| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_48|)) |v_#memory_int_103|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (<= 0 .cse0) (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_104|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_48|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_103|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_77|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1] 1011#[L102-6]don't care [981] L102-6-->L102-14: Formula: (and (= |v_#valid_Out_14| (store |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5| v_~a1~0.base_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5| v_~a1~0.offset_Out_2) (= (select |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_10| (store |v_#length_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= v_~n2~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #valid=|v_#valid_In_9|, #length=|v_#length_In_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ~a1~0.base=v_~a1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_Out_10|, #valid=|v_#valid_Out_14|, ~a1~0.offset=v_~a1~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_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[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, ~a1~0.offset, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1013#[L102-14]don't care [944] L102-14-->L84-3: Formula: (and (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_21|)) |v_#memory_int_107|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| v_~a2~0.base_51) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| v_~a2~0.offset_51) (= (select |v_#valid_178| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|) (= |v_ULTIMATE.start_main_#t~pre17#1_21| |v_#pthreadsForks_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_87|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_108|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|, ~a2~0.base=v_~a2~0.base_51, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_21|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_107|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ~a2~0.offset=v_~a2~0.offset_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a2~0.offset, ULTIMATE.start_main_#t~pre17#1] 1085#[L84-3]don't care [690] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_8|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_12|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_8|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_8|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_12|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_20|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_18|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1083#[thread1ENTRY, L84-4]don't care [791] thread1ENTRY-->L50-2: Formula: (and (= (+ v_~n1~0_18 (* (- 1) v_~n2~0_18)) v_~res1~0_15) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| 0)) InVars {~n2~0=v_~n2~0_18, ~n1~0=v_~n1~0_18} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_18, ~n1~0=v_~n1~0_18, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] 1031#[L50-2, L84-4]don't care [2022-07-22 12:42:00,195 INFO L750 eck$LassoCheckResult]: Loop: 1031#[L50-2, L84-4]don't care [783] L50-2-->L51-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_31| 4))) (let ((.cse0 (+ .cse1 v_~a1~0.offset_15))) (and (= (select (select |v_#memory_int_45| v_~a1~0.base_15) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_17|) (= (select |v_#valid_68| v_~a1~0.base_15) 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_31| v_~n1~0_16) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_31| v_~n2~0_16) (<= (+ 4 .cse1 v_~a1~0.offset_15) (select |v_#length_59| v_~a1~0.base_15))))) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_16, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, #valid=|v_#valid_68|, ~a1~0.offset=v_~a1~0.offset_15, #memory_int=|v_#memory_int_45|, #length=|v_#length_59|, ~a1~0.base=v_~a1~0.base_15} OutVars{~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_16, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, #valid=|v_#valid_68|, ~a1~0.offset=v_~a1~0.offset_15, #memory_int=|v_#memory_int_45|, #length=|v_#length_59|, ~a1~0.base=v_~a1~0.base_15, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1027#[L51-1, L84-4]don't care [891] L51-1-->L50-2: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_50| 4))) (let ((.cse0 (+ .cse1 v_~a2~0.offset_35))) (and (= (select |v_#valid_132| v_~a2~0.base_35) 1) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| (+ |v_thread1Thread1of1ForFork0_~i~0#1_50| 1)) (= (select (select |v_#memory_int_75| v_~a2~0.base_35) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_30|) (<= 0 .cse0) (<= (+ .cse1 4 v_~a2~0.offset_35) (select |v_#length_115| v_~a2~0.base_35))))) InVars {~a2~0.base=v_~a2~0.base_35, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_50|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_75|, #length=|v_#length_115|, ~a2~0.offset=v_~a2~0.offset_35, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_30|} OutVars{~a2~0.base=v_~a2~0.base_35, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_15|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_75|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_27|, #length=|v_#length_115|, ~a2~0.offset=v_~a2~0.offset_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem1#1] 1031#[L50-2, L84-4]don't care [2022-07-22 12:42:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -162406470, now seen corresponding path program 1 times [2022-07-22 12:42:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873741421] [2022-07-22 12:42:00,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:42:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:42:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 26125, now seen corresponding path program 2 times [2022-07-22 12:42:00,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397149763] [2022-07-22 12:42:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,305 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:42:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:42:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1453769850, now seen corresponding path program 1 times [2022-07-22 12:42:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526032033] [2022-07-22 12:42:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:42:00,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:42:00,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:42:00,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526032033] [2022-07-22 12:42:00,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526032033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:42:00,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:42:00,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 12:42:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305347686] [2022-07-22 12:42:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:42:00,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:42:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:42:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:42:00,473 INFO L87 Difference]: Start difference. First operand 67 states and 156 transitions. cyclomatic complexity: 114 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:42:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:42:00,605 INFO L93 Difference]: Finished difference Result 107 states and 238 transitions. [2022-07-22 12:42:00,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 238 transitions. [2022-07-22 12:42:00,607 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 42 [2022-07-22 12:42:00,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 103 states and 230 transitions. [2022-07-22 12:42:00,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2022-07-22 12:42:00,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2022-07-22 12:42:00,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 230 transitions. [2022-07-22 12:42:00,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:42:00,611 INFO L220 hiAutomatonCegarLoop]: Abstraction has 103 states and 230 transitions. [2022-07-22 12:42:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 230 transitions. [2022-07-22 12:42:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2022-07-22 12:42:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.328358208955224) internal successors, (156), 66 states have internal predecessors, (156), 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:42:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 156 transitions. [2022-07-22 12:42:00,619 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67 states and 156 transitions. [2022-07-22 12:42:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:42:00,620 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 156 transitions. [2022-07-22 12:42:00,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:42:00,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 156 transitions. [2022-07-22 12:42:00,622 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 30 [2022-07-22 12:42:00,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:42:00,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:42:00,622 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:42:00,623 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:42:00,624 INFO L748 eck$LassoCheckResult]: Stem: 1324#[ULTIMATE.startENTRY]don't care [982] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse1 (store |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_131| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) (= (select .cse0 0) 48) (= (select |v_#valid_239| 2) 1) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (= (select |v_#length_204| 2) 25) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| |v_#StackHeapBarrier_52|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|) (= v_~res2~0_65 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201| 0)) (= (select |v_#valid_239| 1) 1) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~res1~0_63 0) (= v_~a2~0.base_73 0) (= v_~a2~0.offset_73 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 1) |v_#valid_238|) (= |v_#NULL.offset_8| 0) (= v_~a1~0.base_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113| 0) (= |v_#NULL.base_8| 0) (= (select .cse0 1) 0) (= (select |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| v_~n1~0_66) (= 0 v_~a1~0.offset_61) (= (select |v_#valid_239| 0) 0) (= (select |v_#length_204| 1) 2) (= (store (store (store |v_#length_204| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_203|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_239|, #memory_int=|v_#memory_int_131|, #length=|v_#length_204|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_85|, ~res1~0=v_~res1~0_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~n1~0=v_~n1~0_66, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ~a1~0.base=v_~a1~0.base_61, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_20|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|, ~a2~0.base=v_~a2~0.base_73, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_85|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_24|, #length=|v_#length_203|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_65|, ~a2~0.offset=v_~a2~0.offset_73, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_32|, ~res2~0=v_~res2~0_65, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|, ~n2~0=v_~n2~0_74, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_26|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_51|, #valid=|v_#valid_238|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, ~a1~0.offset=v_~a1~0.offset_61, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_63|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ~n1~0, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~pre19#1, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ~a2~0.offset, ULTIMATE.start_main_#t~mem22#1, ~res2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_main_#t~nondet20#1, ~a1~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1262#[L102-6]don't care [981] L102-6-->L102-14: Formula: (and (= |v_#valid_Out_14| (store |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5| v_~a1~0.base_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5| v_~a1~0.offset_Out_2) (= (select |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_10| (store |v_#length_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= v_~n2~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #valid=|v_#valid_In_9|, #length=|v_#length_In_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ~a1~0.base=v_~a1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_Out_10|, #valid=|v_#valid_Out_14|, ~a1~0.offset=v_~a1~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_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[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, ~a1~0.offset, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1264#[L102-14]don't care [944] L102-14-->L84-3: Formula: (and (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_21|)) |v_#memory_int_107|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| v_~a2~0.base_51) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| v_~a2~0.offset_51) (= (select |v_#valid_178| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|) (= |v_ULTIMATE.start_main_#t~pre17#1_21| |v_#pthreadsForks_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_87|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_108|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|, ~a2~0.base=v_~a2~0.base_51, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_21|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_107|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ~a2~0.offset=v_~a2~0.offset_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a2~0.offset, ULTIMATE.start_main_#t~pre17#1] 1214#[L84-3]don't care [690] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_8|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_12|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_8|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_8|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_12|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_20|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_18|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1216#[thread1ENTRY, L84-4]don't care [917] L84-4-->L85-3: Formula: (and (= (store |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_90| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre19#1_21|)) |v_#memory_int_89|) (= (+ |v_#pthreadsForks_28| 1) |v_#pthreadsForks_27|) (= |v_ULTIMATE.start_main_#t~pre19#1_21| |v_#pthreadsForks_28|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_23| 4) (select |v_#length_135| |v_ULTIMATE.start_main_~#t2~0#1.base_27|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_23|) (= (select |v_#valid_156| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) 1)) InVars {#pthreadsForks=|v_#pthreadsForks_28|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_90|, #length=|v_#length_135|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_23|, #valid=|v_#valid_156|, #memory_int=|v_#memory_int_89|, #length=|v_#length_135|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_11|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_19|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_21|} AuxVars[] AssignedVars[#pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~pre19#1] 1256#[thread1ENTRY, L85-3]don't care [693] L85-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre19#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_12|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_8|, thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_8|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_12|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_8|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_20|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_12|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_18|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_8|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_12|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_6|, thread2Thread1of1ForFork1_#t~mem10#1=|v_thread2Thread1of1ForFork1_#t~mem10#1_8|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#t~ret11#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_#t~mem10#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1258#[L85-4, thread2ENTRY, thread1ENTRY]don't care [782] thread2ENTRY-->L64-2: Formula: (and (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_27|) (= (+ (* (- 1) v_~n1~0_14) v_~n2~0_14) v_~res2~0_15)) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~res2~0=v_~res2~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1, ~res2~0] 1292#[L85-4, L64-2, thread1ENTRY]don't care [2022-07-22 12:42:00,624 INFO L750 eck$LassoCheckResult]: Loop: 1292#[L85-4, L64-2, thread1ENTRY]don't care [942] L64-2-->L64-2: Formula: (let ((.cse0 (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_52|))) (let ((.cse1 (+ .cse0 v_~a1~0.offset_39)) (.cse2 (+ .cse0 v_~a2~0.offset_49))) (and (= 1 (select |v_#valid_174| v_~a2~0.base_49)) (<= (+ .cse0 4 v_~a2~0.offset_49) (select |v_#length_147| v_~a2~0.base_49)) (< |v_thread2Thread1of1ForFork1_~i~1#1_52| v_~n1~0_52) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_52|) |v_thread2Thread1of1ForFork1_~i~1#1_51|) (<= 0 .cse1) (= (select |v_#valid_174| v_~a1~0.base_39) 1) (= (select (select |v_#memory_int_101| v_~a2~0.base_49) .cse2) (select (select |v_#memory_int_101| v_~a1~0.base_39) .cse1)) (<= 0 .cse2) (<= (+ .cse0 4 v_~a1~0.offset_39) (select |v_#length_147| v_~a1~0.base_39)) (< |v_thread2Thread1of1ForFork1_~i~1#1_52| v_~n2~0_54)))) InVars {~a2~0.base=v_~a2~0.base_49, ~n2~0=v_~n2~0_54, ~n1~0=v_~n1~0_52, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_101|, ~a1~0.offset=v_~a1~0.offset_39, #length=|v_#length_147|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_52|, ~a2~0.offset=v_~a2~0.offset_49, ~a1~0.base=v_~a1~0.base_39} OutVars{thread2Thread1of1ForFork1_#t~mem8#1=|v_thread2Thread1of1ForFork1_#t~mem8#1_37|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_19|, ~n2~0=v_~n2~0_54, ~n1~0=v_~n1~0_52, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_51|, ~a1~0.base=v_~a1~0.base_39, ~a2~0.base=v_~a2~0.base_49, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_37|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_101|, ~a1~0.offset=v_~a1~0.offset_39, #length=|v_#length_147|, ~a2~0.offset=v_~a2~0.offset_49} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem8#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_~i~1#1] 1292#[L85-4, L64-2, thread1ENTRY]don't care [2022-07-22 12:42:00,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash 306753164, now seen corresponding path program 1 times [2022-07-22 12:42:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940624276] [2022-07-22 12:42:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,643 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:42:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:42:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash 973, now seen corresponding path program 1 times [2022-07-22 12:42:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63843563] [2022-07-22 12:42:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:42:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:42:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash 919414434, now seen corresponding path program 1 times [2022-07-22 12:42:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694771536] [2022-07-22 12:42:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:42:00,722 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:42:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:42:00,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694771536] [2022-07-22 12:42:00,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694771536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:42:00,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:42:00,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:42:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592092385] [2022-07-22 12:42:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:42:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:42:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:42:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:42:00,784 INFO L87 Difference]: Start difference. First operand 67 states and 156 transitions. cyclomatic complexity: 114 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:42:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:42:00,880 INFO L93 Difference]: Finished difference Result 90 states and 193 transitions. [2022-07-22 12:42:00,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 193 transitions. [2022-07-22 12:42:00,882 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 30 [2022-07-22 12:42:00,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 65 states and 151 transitions. [2022-07-22 12:42:00,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-22 12:42:00,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-07-22 12:42:00,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 151 transitions. [2022-07-22 12:42:00,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:42:00,885 INFO L220 hiAutomatonCegarLoop]: Abstraction has 65 states and 151 transitions. [2022-07-22 12:42:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 151 transitions. [2022-07-22 12:42:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-22 12:42:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.3230769230769233) internal successors, (151), 64 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:42:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 151 transitions. [2022-07-22 12:42:00,891 INFO L242 hiAutomatonCegarLoop]: Abstraction has 65 states and 151 transitions. [2022-07-22 12:42:00,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:42:00,892 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 151 transitions. [2022-07-22 12:42:00,892 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:42:00,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 151 transitions. [2022-07-22 12:42:00,893 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 30 [2022-07-22 12:42:00,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:42:00,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:42:00,893 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:42:00,894 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:42:00,895 INFO L748 eck$LassoCheckResult]: Stem: 1558#[ULTIMATE.startENTRY]don't care [982] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse1 (store |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1)) (.cse0 (select |v_#memory_int_131| 1))) (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_45| 0) (not (= 0 (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) 1 0))) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) (= (select .cse0 0) 48) (= (select |v_#valid_239| 2) 1) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (= (select |v_#length_204| 2) 25) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| |v_#StackHeapBarrier_52|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|) (= v_~res2~0_65 0) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_201| 0)) (= (select |v_#valid_239| 1) 1) (< 0 |v_#StackHeapBarrier_52|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_115|) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~res1~0_63 0) (= v_~a2~0.base_73 0) (= v_~a2~0.offset_73 0) (= (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 1) |v_#valid_238|) (= |v_#NULL.offset_8| 0) (= v_~a1~0.base_61 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113| 0) (= |v_#NULL.base_8| 0) (= (select .cse0 1) 0) (= (select |v_#valid_239| |v_ULTIMATE.start_main_~#t1~0#1.base_55|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45| v_~n1~0_66) (= 0 v_~a1~0.offset_61) (= (select |v_#valid_239| 0) 0) (= (select |v_#length_204| 1) 2) (= (store (store (store |v_#length_204| |v_ULTIMATE.start_main_~#t1~0#1.base_55| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_115| 4)) |v_#length_203|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_52|, #valid=|v_#valid_239|, #memory_int=|v_#memory_int_131|, #length=|v_#length_204|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_85|, ~res1~0=v_~res1~0_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_103|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_51|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~n1~0=v_~n1~0_66, #NULL.offset=|v_#NULL.offset_8|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_63|, ~a1~0.base=v_~a1~0.base_61, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_20|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_29|, ~a2~0.base=v_~a2~0.base_73, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_45|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_29|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_201|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_85|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_24|, #length=|v_#length_203|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_113|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_65|, ~a2~0.offset=v_~a2~0.offset_73, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_32|, ~res2~0=v_~res2~0_65, ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_103|, ~n2~0=v_~n2~0_74, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_55|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_115|, #NULL.base=|v_#NULL.base_8|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_26|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_63|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_51|, #valid=|v_#valid_238|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_17|, ~a1~0.offset=v_~a1~0.offset_61, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_63|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_159|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ~n1~0, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_#t~pre19#1, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret16#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ~a2~0.offset, ULTIMATE.start_main_#t~mem22#1, ~res2~0, ULTIMATE.start_main_#t~ret16#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~n2~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_main_#t~nondet20#1, ~a1~0.offset, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1496#[L102-6]don't care [943] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_77|) (= (store |v_#memory_int_104| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69| (store (select |v_#memory_int_104| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_48|)) |v_#memory_int_103|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69| 4) (select |v_#length_149| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78| |v_ULTIMATE.start_create_fresh_int_array_~size#1_85|) (<= 0 .cse0) (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_104|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_78|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_48|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_69|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_69|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_103|, #length=|v_#length_149|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_77|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_85|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1] 1498#[L102-6]don't care [981] L102-6-->L102-14: Formula: (and (= |v_#valid_Out_14| (store |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5| v_~a1~0.base_Out_2) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5| v_~a1~0.offset_Out_2) (= (select |v_#valid_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_10| (store |v_#length_In_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|)) (= v_~n2~0_In_7 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| |v_#StackHeapBarrier_In_5|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10| 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10| 0)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_5|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_5|, #valid=|v_#valid_In_9|, #length=|v_#length_In_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_In_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_9|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset_Out_10|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_10|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_10|, ~n2~0=v_~n2~0_In_7, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_10|, ~a1~0.base=v_~a1~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_10|, #StackHeapBarrier=|v_#StackHeapBarrier_In_5|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_26|, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base_Out_10|, #valid=|v_#valid_Out_14|, ~a1~0.offset=v_~a1~0.offset_Out_2, #length=|v_#length_Out_10|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_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[ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a1~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_int_array_#t~malloc23#1.base, #valid, ~a1~0.offset, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1500#[L102-14]don't care [918] L102-14-->L102-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| .cse1))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66| |v_ULTIMATE.start_create_fresh_int_array_~size#1_71|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_65| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66| 1)) (= |v_#memory_int_93| (store |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_94| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_38|))) (= (select |v_#valid_158| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) 1) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4 .cse1) (select |v_#length_137| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_94|, #length=|v_#length_137|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_66|, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet25#1_38|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_71|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, #valid=|v_#valid_158|, #memory_int=|v_#memory_int_93|, #length=|v_#length_137|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_65|, ULTIMATE.start_create_fresh_int_array_#t~post24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post24#1_39|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_71|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_#t~nondet25#1, ULTIMATE.start_create_fresh_int_array_#t~post24#1] 1548#[L102-14]don't care [944] L102-14-->L84-3: Formula: (and (= (store |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_108| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_21|)) |v_#memory_int_107|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| v_~a2~0.base_51) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|) (select |v_#length_151| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| v_~a2~0.offset_51) (= (select |v_#valid_178| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|) (= |v_ULTIMATE.start_main_#t~pre17#1_21| |v_#pthreadsForks_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81| |v_ULTIMATE.start_create_fresh_int_array_~size#1_87|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_31|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_108|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|} OutVars{ULTIMATE.start_main_#t~ret16#1.base=|v_ULTIMATE.start_main_#t~ret16#1.base_21|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_71|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_71|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_43|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_87|, ~a2~0.base=v_~a2~0.base_51, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_43|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~ret16#1.offset=|v_ULTIMATE.start_main_#t~ret16#1.offset_21|, #valid=|v_#valid_178|, #memory_int=|v_#memory_int_107|, #length=|v_#length_151|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_81|, ~a2~0.offset=v_~a2~0.offset_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret16#1.base, ~a2~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret16#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~a2~0.offset, ULTIMATE.start_main_#t~pre17#1] 1550#[L84-3]don't care [690] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_8|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_12|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_6|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_10|, thread1Thread1of1ForFork0_#t~ret5#1=|v_thread1Thread1of1ForFork0_#t~ret5#1_8|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_8|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_12|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_20|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_12|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_18|, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_8|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_12|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~ret5#1, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] 1572#[thread1ENTRY, L84-4]don't care [791] thread1ENTRY-->L50-2: Formula: (and (= (+ v_~n1~0_18 (* (- 1) v_~n2~0_18)) v_~res1~0_15) (= |v_thread1Thread1of1ForFork0_~i~0#1_33| 0)) InVars {~n2~0=v_~n2~0_18, ~n1~0=v_~n1~0_18} OutVars{~res1~0=v_~res1~0_15, ~n2~0=v_~n2~0_18, ~n1~0=v_~n1~0_18, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_33|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork0_~i~0#1] 1518#[L50-2, L84-4]don't care [2022-07-22 12:42:00,895 INFO L750 eck$LassoCheckResult]: Loop: 1518#[L50-2, L84-4]don't care [783] L50-2-->L51-1: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_31| 4))) (let ((.cse0 (+ .cse1 v_~a1~0.offset_15))) (and (= (select (select |v_#memory_int_45| v_~a1~0.base_15) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_17|) (= (select |v_#valid_68| v_~a1~0.base_15) 1) (< |v_thread1Thread1of1ForFork0_~i~0#1_31| v_~n1~0_16) (<= 0 .cse0) (< |v_thread1Thread1of1ForFork0_~i~0#1_31| v_~n2~0_16) (<= (+ 4 .cse1 v_~a1~0.offset_15) (select |v_#length_59| v_~a1~0.base_15))))) InVars {~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_16, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, #valid=|v_#valid_68|, ~a1~0.offset=v_~a1~0.offset_15, #memory_int=|v_#memory_int_45|, #length=|v_#length_59|, ~a1~0.base=v_~a1~0.base_15} OutVars{~n2~0=v_~n2~0_16, ~n1~0=v_~n1~0_16, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_31|, #valid=|v_#valid_68|, ~a1~0.offset=v_~a1~0.offset_15, #memory_int=|v_#memory_int_45|, #length=|v_#length_59|, ~a1~0.base=v_~a1~0.base_15, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] 1514#[L51-1, L84-4]don't care [891] L51-1-->L50-2: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork0_~i~0#1_50| 4))) (let ((.cse0 (+ .cse1 v_~a2~0.offset_35))) (and (= (select |v_#valid_132| v_~a2~0.base_35) 1) (= |v_thread1Thread1of1ForFork0_~i~0#1_49| (+ |v_thread1Thread1of1ForFork0_~i~0#1_50| 1)) (= (select (select |v_#memory_int_75| v_~a2~0.base_35) .cse0) |v_thread1Thread1of1ForFork0_#t~mem1#1_30|) (<= 0 .cse0) (<= (+ .cse1 4 v_~a2~0.offset_35) (select |v_#length_115| v_~a2~0.base_35))))) InVars {~a2~0.base=v_~a2~0.base_35, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_50|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_75|, #length=|v_#length_115|, ~a2~0.offset=v_~a2~0.offset_35, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_30|} OutVars{~a2~0.base=v_~a2~0.base_35, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_15|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_49|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_75|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_27|, #length=|v_#length_115|, ~a2~0.offset=v_~a2~0.offset_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~mem1#1] 1518#[L50-2, L84-4]don't care [2022-07-22 12:42:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash -740166086, now seen corresponding path program 1 times [2022-07-22 12:42:00,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191372892] [2022-07-22 12:42:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,922 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:42:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:42:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,944 INFO L85 PathProgramCache]: Analyzing trace with hash 26125, now seen corresponding path program 3 times [2022-07-22 12:42:00,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658664693] [2022-07-22 12:42:00,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:42:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:42:00,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:42:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1664987654, now seen corresponding path program 1 times [2022-07-22 12:42:00,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:42:00,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499471882] [2022-07-22 12:42:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:42:00,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:42:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:00,988 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:42:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:42:01,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:42:01,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:42:03,071 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:42:03,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:42:03,071 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:42:03,071 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:42:03,072 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:42:03,072 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:42:03,072 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:42:03,072 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:42:03,072 INFO L133 ssoRankerPreferences]: Filename of dumped script: chl-array-int-symm.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:42:03,072 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:42:03,072 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:42:03,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:42:03,522 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:42:03,524 INFO L158 Benchmark]: Toolchain (without parser) took 22431.00ms. Allocated memory was 158.3MB in the beginning and 231.7MB in the end (delta: 73.4MB). Free memory was 133.9MB in the beginning and 201.9MB in the end (delta: -68.1MB). Peak memory consumption was 137.6MB. Max. memory is 8.0GB. [2022-07-22 12:42:03,525 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 158.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:42:03,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.63ms. Allocated memory is still 158.3MB. Free memory was 133.7MB in the beginning and 122.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:42:03,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.78ms. Allocated memory is still 158.3MB. Free memory was 122.5MB in the beginning and 120.2MB in the end (delta: 2.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-07-22 12:42:03,526 INFO L158 Benchmark]: Boogie Preprocessor took 52.89ms. Allocated memory is still 158.3MB. Free memory was 120.2MB in the beginning and 118.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:42:03,526 INFO L158 Benchmark]: RCFGBuilder took 835.32ms. Allocated memory is still 158.3MB. Free memory was 118.6MB in the beginning and 138.2MB in the end (delta: -19.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-07-22 12:42:03,527 INFO L158 Benchmark]: BuchiAutomizer took 21149.65ms. Allocated memory was 158.3MB in the beginning and 231.7MB in the end (delta: 73.4MB). Free memory was 137.6MB in the beginning and 201.9MB in the end (delta: -64.3MB). Peak memory consumption was 140.7MB. Max. memory is 8.0GB. [2022-07-22 12:42:03,529 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.19ms. Allocated memory is still 158.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 325.63ms. Allocated memory is still 158.3MB. Free memory was 133.7MB in the beginning and 122.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.78ms. Allocated memory is still 158.3MB. Free memory was 122.5MB in the beginning and 120.2MB in the end (delta: 2.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.89ms. Allocated memory is still 158.3MB. Free memory was 120.2MB in the beginning and 118.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 835.32ms. Allocated memory is still 158.3MB. Free memory was 118.6MB in the beginning and 138.2MB in the end (delta: -19.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 21149.65ms. Allocated memory was 158.3MB in the beginning and 231.7MB in the end (delta: 73.4MB). Free memory was 137.6MB in the beginning and 201.9MB in the end (delta: -64.3MB). Peak memory consumption was 140.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 235 PlacesBefore, 25 PlacesAfterwards, 249 TransitionsBefore, 23 TransitionsAfterwards, 6272 CoEnabledTransitionPairs, 8 FixpointIterations, 125 TrivialSequentialCompositions, 94 ConcurrentSequentialCompositions, 29 TrivialYvCompositions, 23 ConcurrentYvCompositions, 16 ChoiceCompositions, 287 TotalNumberOfCompositions, 6670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6080, positive: 6001, positive conditional: 0, positive unconditional: 6001, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3660, positive: 3642, positive conditional: 0, positive unconditional: 3642, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6080, positive: 2359, positive conditional: 0, positive unconditional: 2359, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 3660, unknown conditional: 0, unknown unconditional: 3660] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - 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:42:03,571 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...