/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:19:09,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:19:09,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:19:09,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:19:09,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:19:09,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:19:09,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:19:09,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:19:09,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:19:09,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:19:09,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:19:09,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:19:09,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:19:09,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:19:09,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:19:09,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:19:09,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:19:09,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:19:09,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:19:09,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:19:09,761 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:19:09,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:19:09,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:19:09,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:19:09,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:19:09,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:19:09,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:19:09,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:19:09,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:19:09,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:19:09,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:19:09,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:19:09,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:19:09,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:19:09,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:19:09,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:19:09,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:19:09,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:19:09,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:19:09,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:19:09,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:19:09,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:19:09,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:19:09,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:19:09,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:19:09,852 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:19:09,852 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:19:09,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:19:09,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:19:09,854 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:19:09,854 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:19:09,854 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:19:09,855 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:19:09,856 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:19:09,856 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:19:09,856 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:19:09,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:19:09,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:19:09,857 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:19:09,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:19:09,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:19:09,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:19:09,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:19:09,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:19:09,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:19:09,858 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:19:09,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:19:09,858 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:19:09,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:19:09,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:19:09,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:19:09,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:19:09,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:19:09,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:19:09,863 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:19:09,863 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:19:10,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:19:10,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:19:10,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:19:10,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:19:10,263 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:19:10,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-07-22 12:19:10,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11b3b4c6/e1d33bf7707a45dd9abc5ee6d45c00ea/FLAGf8b454618 [2022-07-22 12:19:10,951 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:19:10,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2022-07-22 12:19:10,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11b3b4c6/e1d33bf7707a45dd9abc5ee6d45c00ea/FLAGf8b454618 [2022-07-22 12:19:11,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11b3b4c6/e1d33bf7707a45dd9abc5ee6d45c00ea [2022-07-22 12:19:11,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:19:11,311 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:19:11,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:19:11,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:19:11,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:19:11,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@875511b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11, skipping insertion in model container [2022-07-22 12:19:11,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:19:11,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:19:11,582 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/parallel-misc-1.wvr.c[2755,2768] [2022-07-22 12:19:11,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:19:11,615 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:19:11,641 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/parallel-misc-1.wvr.c[2755,2768] [2022-07-22 12:19:11,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:19:11,664 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:19:11,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11 WrapperNode [2022-07-22 12:19:11,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:19:11,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:19:11,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:19:11,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:19:11,674 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:19:11" (1/1) ... [2022-07-22 12:19:11,685 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:19:11" (1/1) ... [2022-07-22 12:19:11,724 INFO L137 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 259 [2022-07-22 12:19:11,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:19:11,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:19:11,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:19:11,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:19:11,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:19:11,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:19:11,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:19:11,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:19:11,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (1/1) ... [2022-07-22 12:19:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:11,811 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:19:11,829 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:19:11,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:19:11,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:19:11,893 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:19:11,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:19:11,894 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:19:11,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:19:11,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:19:11,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:19:11,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:19:11,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:19:11,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:19:11,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:19:11,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:19:11,899 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:19:12,060 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:19:12,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:19:12,666 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:19:12,683 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:19:12,683 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:19:12,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:19:12 BoogieIcfgContainer [2022-07-22 12:19:12,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:19:12,690 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:19:12,690 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:19:12,694 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:19:12,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:19:12,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:19:11" (1/3) ... [2022-07-22 12:19:12,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a4a366d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:19:12, skipping insertion in model container [2022-07-22 12:19:12,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:19:12,697 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:11" (2/3) ... [2022-07-22 12:19:12,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a4a366d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:19:12, skipping insertion in model container [2022-07-22 12:19:12,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:19:12,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:19:12" (3/3) ... [2022-07-22 12:19:12,699 INFO L322 chiAutomizerObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-07-22 12:19:12,875 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:19:12,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 356 places, 379 transitions, 774 flow [2022-07-22 12:19:13,086 INFO L129 PetriNetUnfolder]: 28/375 cut-off events. [2022-07-22 12:19:13,087 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:19:13,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 28/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 901 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 263. Up to 2 conditions per place. [2022-07-22 12:19:13,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 356 places, 379 transitions, 774 flow [2022-07-22 12:19:13,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 354 places, 375 transitions, 762 flow [2022-07-22 12:19:13,141 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:19:13,163 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 354 places, 375 transitions, 762 flow [2022-07-22 12:19:13,171 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 354 places, 375 transitions, 762 flow [2022-07-22 12:19:13,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 354 places, 375 transitions, 762 flow [2022-07-22 12:19:13,335 INFO L129 PetriNetUnfolder]: 28/375 cut-off events. [2022-07-22 12:19:13,335 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:19:13,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 28/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 903 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 263. Up to 2 conditions per place. [2022-07-22 12:19:13,383 INFO L116 LiptonReduction]: Number of co-enabled transitions 35532 [2022-07-22 12:19:24,083 INFO L131 LiptonReduction]: Checked pairs total: 28625 [2022-07-22 12:19:24,084 INFO L133 LiptonReduction]: Total number of compositions: 448 [2022-07-22 12:19:24,108 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:19:24,109 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:19:24,109 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:19:24,109 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:19:24,109 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:19:24,109 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:19:24,109 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:19:24,110 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:19:24,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:19:24,146 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 17 [2022-07-22 12:19:24,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:24,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:24,153 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:19:24,153 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:19:24,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:19:24,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 26 states, but on-demand construction may add more states [2022-07-22 12:19:24,157 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 17 [2022-07-22 12:19:24,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:24,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:24,158 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:19:24,158 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:19:24,164 INFO L748 eck$LassoCheckResult]: Stem: 359#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (select |v_#memory_int_229| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (and (= (select |v_#valid_263| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= 22 (select |v_#length_230| 2)) (= 2 (select |v_#length_230| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= |v_#NULL.offset_14| 0) (= 48 (select .cse0 0)) (= v_~A~0.offset_147 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (= (select .cse0 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (= |v_#valid_261| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_79| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (store (store (store |v_#length_230| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_228|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select |v_#valid_263| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_106) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= v_~A~0.base_147 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select |v_#valid_263| 0) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_229|, #length=|v_#length_230|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_147, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_79|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_228|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_177, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_123, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_63|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_51|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_142, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_106, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_147, #valid=|v_#valid_261|, ~cap1~0=v_~cap1~0_63, #memory_int=|v_#memory_int_229|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 362#[L113-6]don't care [2022-07-22 12:19:24,164 INFO L750 eck$LassoCheckResult]: Loop: 362#[L113-6]don't care [1460] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1))) (and (<= 0 .cse0) (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_44|) (= |v_#memory_int_95| (store |v_#memory_int_96| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31| (store (select |v_#memory_int_96| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_96|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_15|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_95|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1] 362#[L113-6]don't care [2022-07-22 12:19:24,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1611, now seen corresponding path program 1 times [2022-07-22 12:19:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:24,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785285804] [2022-07-22 12:19:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:24,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:24,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1491, now seen corresponding path program 1 times [2022-07-22 12:19:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:24,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630926689] [2022-07-22 12:19:24,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:24,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:24,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:24,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 51401, now seen corresponding path program 1 times [2022-07-22 12:19:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:24,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860981594] [2022-07-22 12:19:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:24,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:24,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:24,975 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:19:24,975 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:19:24,975 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:19:24,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:19:24,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:19:24,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:24,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:19:24,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:19:24,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-1.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:19:24,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:19:24,977 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:19:25,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:25,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:19:25,804 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:19:25,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:25,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:25,809 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:19:25,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:19:25,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:25,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:25,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:25,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:25,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:25,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:25,841 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:19:25,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:25,887 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:19:25,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:25,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:25,889 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:19:25,899 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:19:25,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:19:25,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:25,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:25,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:25,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:25,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:25,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:25,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:25,914 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:25,947 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:19:25,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:25,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:25,950 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:19:25,952 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:19:25,952 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:19:25,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:25,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:25,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:25,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:25,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:25,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:25,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,010 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:19:26,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,012 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:19:26,013 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:19:26,013 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:19:26,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,058 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:19:26,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,061 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:19:26,065 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:19:26,065 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:19:26,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,090 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,124 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:19:26,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,127 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:19:26,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:19:26,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,151 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:19:26,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,193 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:19:26,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,195 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:19:26,200 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:19:26,200 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:19:26,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:26,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:26,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,241 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:19:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,243 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:19:26,245 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:19:26,245 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:19:26,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,254 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,275 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:19:26,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,277 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:19:26,278 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:19:26,279 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:19:26,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,310 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:19:26,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,312 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:19:26,315 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:19:26,315 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:19:26,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,345 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:19:26,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,347 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:19:26,348 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:19:26,350 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:19:26,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,382 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:19:26,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,383 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:19:26,384 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:19:26,387 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:19:26,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:26,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:26,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,468 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:19:26,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,469 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:19:26,474 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:19:26,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,485 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:19:26,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,519 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:19:26,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,521 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:19:26,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:19:26,524 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:19:26,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,556 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:19:26,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,557 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:19:26,560 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:19:26,561 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:19:26,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,595 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:19:26,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,598 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:19:26,599 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:19:26,599 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:19:26,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:26,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:26,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,670 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:19:26,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,671 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:19:26,680 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:19:26,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,691 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:19:26,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,729 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:19:26,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,731 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:19:26,735 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:19:26,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,746 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:19:26,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,790 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:19:26,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,792 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:19:26,796 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:19:26,797 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:19:26,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 12:19:26,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,829 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:19:26,830 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:19:26,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:19:26,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:26,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:26,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:26,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,863 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:19:26,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,865 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:19:26,865 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:19:26,866 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:19:26,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:26,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:26,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,934 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:19:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,936 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:19:26,938 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:19:26,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:26,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:26,952 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:19:26,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:26,981 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:19:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:26,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:26,982 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:19:26,984 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:19:26,985 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:19:26,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:26,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:26,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:26,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:26,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:26,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,009 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,030 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:19:27,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,032 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:19:27,032 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:19:27,033 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:19:27,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:27,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:27,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,068 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:19:27,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,070 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:19:27,072 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:19:27,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:27,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:27,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:27,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:27,083 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:19:27,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,112 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:19:27,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,114 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:19:27,114 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:19:27,115 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:19:27,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:27,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:27,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,189 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:19:27,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,191 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:19:27,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:19:27,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:27,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:27,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,221 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:19:27,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,263 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:19:27,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,265 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:19:27,270 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:19:27,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:27,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:27,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,286 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:19:27,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:27,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,312 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:19:27,315 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:19:27,316 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:19:27,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,322 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:19:27,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,324 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:19:27,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,360 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:19:27,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,361 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:19:27,362 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:19:27,362 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:19:27,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:27,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:27,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:27,402 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:19:27,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,404 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:19:27,412 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:19:27,420 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:19:27,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:27,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:27,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:27,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:27,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:27,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:27,442 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:19:27,466 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 12:19:27,467 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:19:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:27,476 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:19:27,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:19:27,499 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:19:27,521 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:19:27,522 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:19:27,523 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~1#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:19:27,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:27,614 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:19:27,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:27,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:19:27,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:19:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:27,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:19:27,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:19:27,688 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:19:27,721 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:19:27,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 26 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:19:27,769 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 26 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 28 states and 64 transitions. Complement of second has 3 states. [2022-07-22 12:19:27,771 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:19:27,779 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:19:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:19:27,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:19:27,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:19:27,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:19:27,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:19:27,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:19:27,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:19:27,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 64 transitions. [2022-07-22 12:19:27,792 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:19:27,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 53 transitions. [2022-07-22 12:19:27,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 12:19:27,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 12:19:27,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 53 transitions. [2022-07-22 12:19:27,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:19:27,806 INFO L220 hiAutomatonCegarLoop]: Abstraction has 22 states and 53 transitions. [2022-07-22 12:19:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 53 transitions. [2022-07-22 12:19:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 12:19:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 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:19:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 53 transitions. [2022-07-22 12:19:27,837 INFO L242 hiAutomatonCegarLoop]: Abstraction has 22 states and 53 transitions. [2022-07-22 12:19:27,837 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 53 transitions. [2022-07-22 12:19:27,837 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:19:27,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 53 transitions. [2022-07-22 12:19:27,838 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:19:27,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:27,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:27,839 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:19:27,839 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:19:27,840 INFO L748 eck$LassoCheckResult]: Stem: 530#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (select |v_#memory_int_229| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (and (= (select |v_#valid_263| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= 22 (select |v_#length_230| 2)) (= 2 (select |v_#length_230| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= |v_#NULL.offset_14| 0) (= 48 (select .cse0 0)) (= v_~A~0.offset_147 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (= (select .cse0 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (= |v_#valid_261| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_79| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (store (store (store |v_#length_230| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_228|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select |v_#valid_263| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_106) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= v_~A~0.base_147 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select |v_#valid_263| 0) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_229|, #length=|v_#length_230|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_147, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_79|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_228|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_177, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_123, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_63|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_51|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_142, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_106, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_147, #valid=|v_#valid_261|, ~cap1~0=v_~cap1~0_63, #memory_int=|v_#memory_int_229|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 532#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#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_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#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[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 542#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 528#[L46-1, L97-4]don't care [2022-07-22 12:19:27,840 INFO L750 eck$LassoCheckResult]: Loop: 528#[L46-1, L97-4]don't care [1578] L46-1-->L46-1: Formula: false InVars {} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_45|, ~i~0=v_~i~0_169, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_43|, ~bag1~0=v_~bag1~0_134, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_217|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_103|, ~sum1~0=v_~sum1~0_117, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_55|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_59|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_201|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_211|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_81|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_111|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_183|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_261|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, ~i~0, thread1Thread1of1ForFork1_#t~mem6#1, ~bag1~0, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, ~sum1~0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 528#[L46-1, L97-4]don't care [2022-07-22 12:19:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1597538, now seen corresponding path program 1 times [2022-07-22 12:19:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:27,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728002396] [2022-07-22 12:19:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:27,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:27,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1609, now seen corresponding path program 1 times [2022-07-22 12:19:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:27,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598018012] [2022-07-22 12:19:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:27,963 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:19:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:19:27,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598018012] [2022-07-22 12:19:27,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598018012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:19:27,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:19:27,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-07-22 12:19:27,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857978503] [2022-07-22 12:19:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:19:27,969 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-07-22 12:19:27,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:19:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 12:19:27,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 12:19:27,977 INFO L87 Difference]: Start difference. First operand 22 states and 53 transitions. cyclomatic complexity: 42 Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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:19:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:19:28,018 INFO L93 Difference]: Finished difference Result 22 states and 47 transitions. [2022-07-22 12:19:28,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 47 transitions. [2022-07-22 12:19:28,020 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:19:28,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 47 transitions. [2022-07-22 12:19:28,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 12:19:28,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 12:19:28,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 47 transitions. [2022-07-22 12:19:28,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:19:28,022 INFO L220 hiAutomatonCegarLoop]: Abstraction has 22 states and 47 transitions. [2022-07-22 12:19:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 47 transitions. [2022-07-22 12:19:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 12:19:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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:19:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 47 transitions. [2022-07-22 12:19:28,025 INFO L242 hiAutomatonCegarLoop]: Abstraction has 22 states and 47 transitions. [2022-07-22 12:19:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 12:19:28,027 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 47 transitions. [2022-07-22 12:19:28,027 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:19:28,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 47 transitions. [2022-07-22 12:19:28,028 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:19:28,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:28,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:28,028 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:19:28,028 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:19:28,029 INFO L748 eck$LassoCheckResult]: Stem: 601#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (select |v_#memory_int_229| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (and (= (select |v_#valid_263| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= 22 (select |v_#length_230| 2)) (= 2 (select |v_#length_230| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= |v_#NULL.offset_14| 0) (= 48 (select .cse0 0)) (= v_~A~0.offset_147 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (= (select .cse0 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (= |v_#valid_261| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_79| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (store (store (store |v_#length_230| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_228|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select |v_#valid_263| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_106) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= v_~A~0.base_147 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select |v_#valid_263| 0) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_229|, #length=|v_#length_230|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_147, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_79|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_228|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_177, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_123, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_63|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_51|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_142, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_106, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_147, #valid=|v_#valid_261|, ~cap1~0=v_~cap1~0_63, #memory_int=|v_#memory_int_229|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 603#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#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_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#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[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 613#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 599#[L46-1, L97-4]don't care [2022-07-22 12:19:28,030 INFO L750 eck$LassoCheckResult]: Loop: 599#[L46-1, L97-4]don't care [1575] L46-1-->L122-1: Formula: (let ((.cse0 (* v_~i~0_In_9 4))) (let ((.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|)) (.cse1 (+ .cse0 v_~A~0.offset_In_5))) (and (= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= (+ .cse0 v_~A~0.offset_In_5 4) (select |v_#length_In_9| v_~A~0.base_In_5)) (= (select |v_#valid_In_9| v_~A~0.base_In_5) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (= v_~bag1~0_In_7 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|) (< v_~i~0_In_9 v_~N~0_In_7) (= |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_18| .cse2) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| 0) (<= .cse2 2147483647)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| 2147483648))) 1 0) 0)) (= (select (select |v_#memory_int_In_7| v_~A~0.base_In_5) .cse1) |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|)))) InVars {~A~0.base=v_~A~0.base_In_5, ~A~0.offset=v_~A~0.offset_In_5, ~i~0=v_~i~0_In_9, #valid=|v_#valid_In_9|, ~bag1~0=v_~bag1~0_In_7, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, ~N~0=v_~N~0_In_7} OutVars{~A~0.base=v_~A~0.base_In_5, ~i~0=v_~i~0_In_9, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|, ~bag1~0=v_~bag1~0_In_7, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|, ~N~0=v_~N~0_In_7, ~A~0.offset=v_~A~0.offset_In_5, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|, #valid=|v_#valid_In_9|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 595#[L122-1, L97-4]don't care [1574] L122-1-->L46-1: Formula: (let ((.cse14 (* v_~i~0_In_7 4))) (let ((.cse13 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse12 (+ v_~A~0.offset_In_3 .cse14))) (let ((.cse0 (<= (+ v_~A~0.offset_In_3 .cse14 4) (select |v_#length_In_7| v_~A~0.base_In_3))) (.cse4 (select (select |v_#memory_int_In_5| v_~A~0.base_In_3) .cse12)) (.cse1 (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| .cse13)) (.cse2 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) 1 0) 0))) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6| 0) (<= .cse13 2147483647)) 1 0))) (.cse5 (= (select |v_#valid_In_7| v_~A~0.base_In_3) 1)) (.cse6 (= v_~i~0_Out_2 (+ v_~i~0_In_7 1))) (.cse7 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse8 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0))) (.cse9 (<= 0 .cse12)) (.cse10 (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork1_#t~ret5#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~bag1~0_Out_2) .cse2 (= v_~sum1~0_Out_6 v_~sum1~0_In_5) .cse3 (< |v_thread1Thread1of1ForFork1_plus_#res#1_In_1| v_~cap1~0_In_1) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| .cse4) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem6#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|) .cse6 .cse7 (= v_~bag1~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|) .cse8 .cse9 .cse10 .cse11) (and (= |v_thread1Thread1of1ForFork1_#t~ret4#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|) .cse0 (= .cse4 v_~bag1~0_Out_2) .cse1 .cse2 .cse3 (<= v_~cap1~0_In_1 |v_thread1Thread1of1ForFork1_plus_#res#1_In_1|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~sum1~0_Out_6) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| v_~bag1~0_In_5) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6| v_~sum1~0_In_5)))))) InVars {~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_In_7, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_In_1|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_In_1|, ~bag1~0=v_~bag1~0_In_5, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_In_5, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_In_1|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_Out_2, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|, ~bag1~0=v_~bag1~0_Out_2, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_Out_6, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_6|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, ~i~0, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, ~bag1~0, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, ~sum1~0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 599#[L46-1, L97-4]don't care [2022-07-22 12:19:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1597538, now seen corresponding path program 2 times [2022-07-22 12:19:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:28,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749722647] [2022-07-22 12:19:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:28,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:28,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:28,092 INFO L85 PathProgramCache]: Analyzing trace with hash 51360, now seen corresponding path program 1 times [2022-07-22 12:19:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:28,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964985506] [2022-07-22 12:19:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:28,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:28,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1535284417, now seen corresponding path program 1 times [2022-07-22 12:19:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:28,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598290329] [2022-07-22 12:19:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:28,229 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:19:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:19:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598290329] [2022-07-22 12:19:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598290329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:19:28,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:19:28,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:19:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886271869] [2022-07-22 12:19:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:19:28,677 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:19:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:19:29,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:19:29,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:19:29,079 INFO L87 Difference]: Start difference. First operand 22 states and 47 transitions. cyclomatic complexity: 36 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:19:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:19:29,160 INFO L93 Difference]: Finished difference Result 35 states and 63 transitions. [2022-07-22 12:19:29,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 63 transitions. [2022-07-22 12:19:29,162 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:19:29,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 46 transitions. [2022-07-22 12:19:29,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 12:19:29,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 12:19:29,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 46 transitions. [2022-07-22 12:19:29,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:19:29,163 INFO L220 hiAutomatonCegarLoop]: Abstraction has 22 states and 46 transitions. [2022-07-22 12:19:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 46 transitions. [2022-07-22 12:19:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 12:19:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 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:19:29,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2022-07-22 12:19:29,167 INFO L242 hiAutomatonCegarLoop]: Abstraction has 22 states and 46 transitions. [2022-07-22 12:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:19:29,168 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 46 transitions. [2022-07-22 12:19:29,169 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:19:29,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 46 transitions. [2022-07-22 12:19:29,169 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 16 [2022-07-22 12:19:29,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:29,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:29,170 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:19:29,170 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:19:29,171 INFO L748 eck$LassoCheckResult]: Stem: 691#[ULTIMATE.startENTRY]don't care [1580] ULTIMATE.startENTRY-->L113-6: Formula: (let ((.cse2 (store |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 1))) (let ((.cse0 (select |v_#memory_int_229| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85| 1))) (and (= (select |v_#valid_263| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= 22 (select |v_#length_230| 2)) (= 2 (select |v_#length_230| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 0)) (= |v_#NULL.base_14| 0) (= |v_#NULL.offset_14| 0) (= 48 (select .cse0 0)) (= v_~A~0.offset_147 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) (= (select .cse0 1) 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| |v_#StackHeapBarrier_41|) (= |v_#valid_261| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| 1)) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_79| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56| 0) (= (store (store (store |v_#length_230| |v_ULTIMATE.start_main_~#t1~0#1.base_63| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_85| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_228|) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= (select |v_#valid_263| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| v_~N~0_106) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_85|) 0) (< |v_#StackHeapBarrier_41| |v_ULTIMATE.start_main_~#t2~0#1.base_85|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (= v_~A~0.base_147 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= (select |v_#valid_263| 0) 0) (< 0 |v_#StackHeapBarrier_41|) (= (select |v_#valid_263| |v_ULTIMATE.start_main_~#t1~0#1.base_63|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49| 0) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_41|, #valid=|v_#valid_263|, #memory_int=|v_#memory_int_229|, #length=|v_#length_230|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_49|, ~A~0.base=v_~A~0.base_147, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_34|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_79|, #NULL.offset=|v_#NULL.offset_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset_35|, ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_23|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_34|, ~cap2~0=v_~cap2~0_51, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_19|, #length=|v_#length_228|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#1.offset_39|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_49|, ~i~0=v_~i~0_177, ~bag2~0=v_~bag2~0_112, ~sum2~0=v_~sum2~0_101, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_30|, #StackHeapBarrier=|v_#StackHeapBarrier_41|, ~sum1~0=v_~sum1~0_123, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_32|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_63|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_51|, ~j~0=v_~j~0_125, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_39|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_36|, ~bag1~0=v_~bag1~0_142, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_56|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_30|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_17|, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_24|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_38|, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_34|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_32|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_34|, ~N~0=v_~N~0_106, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_63|, #NULL.base=|v_#NULL.base_14|, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base_35|, ~A~0.offset=v_~A~0.offset_147, #valid=|v_#valid_261|, ~cap1~0=v_~cap1~0_63, #memory_int=|v_#memory_int_229|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_38|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_36|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_85|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_main_#t~nondet22#1, ~cap2~0, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~i~0, ~bag2~0, ~sum2~0, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sum1~0, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1, ~j~0, ULTIMATE.start_main_#t~ret26#1.base, ULTIMATE.start_main_#t~nondet25#1, ~bag1~0, ULTIMATE.start_create_fresh_int_array_~i~1#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~malloc33#1.base, ~A~0.offset, #valid, ~cap1~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 693#[L113-6]don't care [1460] L113-6-->L113-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1))) (and (<= 0 .cse0) (= (select |v_#valid_141| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| |v_ULTIMATE.start_create_fresh_int_array_~size#1_44|) (= |v_#memory_int_95| (store |v_#memory_int_96| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31| (store (select |v_#memory_int_96| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|))) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31| .cse1 4) (select |v_#length_114| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37| 1))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet35#1_17|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_96|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_37|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post34#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post34#1_15|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_31|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_31|, #valid=|v_#valid_141|, #memory_int=|v_#memory_int_95|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_36|, #length=|v_#length_114|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_44|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post34#1, ULTIMATE.start_create_fresh_int_array_#t~nondet35#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~1#1] 723#[L113-6]don't care [1556] L113-6-->L97-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (= |v_#memory_int_Out_2| (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|))) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre27#1_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (and (= v_~bag1~0_In_1 v_~i~0_In_3) (= v_~bag1~0_In_1 0) (= v_~bag1~0_In_1 v_~bag2~0_In_1) (= v_~sum2~0_In_1 v_~bag1~0_In_1) (= v_~bag1~0_In_1 v_~sum1~0_In_1) (= v_~j~0_In_3 v_~bag1~0_In_1)) 1 0)) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~bag1~0=v_~bag1~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_3|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ~j~0=v_~j~0_In_3, ULTIMATE.start_main_#t~ret26#1.base=|v_ULTIMATE.start_main_#t~ret26#1.base_Out_2|, ~bag1~0=v_~bag1~0_In_1, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, #pthreadsForks=|v_#pthreadsForks_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_10|, #length=|v_#length_In_3|, ULTIMATE.start_main_#t~ret26#1.offset=|v_ULTIMATE.start_main_#t~ret26#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_In_3|, ~i~0=v_~i~0_In_3, ~bag2~0=v_~bag2~0_In_1, ~sum2~0=v_~sum2~0_In_1, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_7|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, ~sum1~0=v_~sum1~0_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_Out_2|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#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[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret26#1.base, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret26#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 703#[L97-3]don't care [1131] L97-3-->L46-1: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre27#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_8|, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_8|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_42|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_18|, thread1Thread1of1ForFork1_#t~ret8#1=|v_thread1Thread1of1ForFork1_#t~ret8#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_8|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_12|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_34|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_6|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_8|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_42|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_10|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_66|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_26|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_#t~ret8#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 689#[L46-1, L97-4]don't care [2022-07-22 12:19:29,172 INFO L750 eck$LassoCheckResult]: Loop: 689#[L46-1, L97-4]don't care [1575] L46-1-->L122-1: Formula: (let ((.cse0 (* v_~i~0_In_9 4))) (let ((.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|)) (.cse1 (+ .cse0 v_~A~0.offset_In_5))) (and (= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= (+ .cse0 v_~A~0.offset_In_5 4) (select |v_#length_In_9| v_~A~0.base_In_5)) (= (select |v_#valid_In_9| v_~A~0.base_In_5) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (= v_~bag1~0_In_7 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|) (< v_~i~0_In_9 v_~N~0_In_7) (= |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_18| .cse2) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| 0)) (= (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| 0) (<= .cse2 2147483647)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~b#1_Out_10| |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| 2147483648))) 1 0) 0)) (= (select (select |v_#memory_int_In_7| v_~A~0.base_In_5) .cse1) |v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|) (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_10| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|)))) InVars {~A~0.base=v_~A~0.base_In_5, ~A~0.offset=v_~A~0.offset_In_5, ~i~0=v_~i~0_In_9, #valid=|v_#valid_In_9|, ~bag1~0=v_~bag1~0_In_7, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, ~N~0=v_~N~0_In_7} OutVars{~A~0.base=v_~A~0.base_In_5, ~i~0=v_~i~0_In_9, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_10|, ~bag1~0=v_~bag1~0_In_7, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_10|, ~N~0=v_~N~0_In_7, ~A~0.offset=v_~A~0.offset_In_5, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_14|, #valid=|v_#valid_In_9|, #memory_int=|v_#memory_int_In_7|, #length=|v_#length_In_9|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_10|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_10|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_18|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 685#[L122-1, L97-4]don't care [1574] L122-1-->L46-1: Formula: (let ((.cse14 (* v_~i~0_In_7 4))) (let ((.cse13 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse12 (+ v_~A~0.offset_In_3 .cse14))) (let ((.cse0 (<= (+ v_~A~0.offset_In_3 .cse14 4) (select |v_#length_In_7| v_~A~0.base_In_3))) (.cse4 (select (select |v_#memory_int_In_5| v_~A~0.base_In_3) .cse12)) (.cse1 (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| .cse13)) (.cse2 (not (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| 2147483648 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) 1 0) 0))) (.cse3 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10| (ite (or (<= |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6| 0) (<= .cse13 2147483647)) 1 0))) (.cse5 (= (select |v_#valid_In_7| v_~A~0.base_In_3) 1)) (.cse6 (= v_~i~0_Out_2 (+ v_~i~0_In_7 1))) (.cse7 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| |v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|)) (.cse8 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| 0))) (.cse9 (<= 0 .cse12)) (.cse10 (= |v_thread1Thread1of1ForFork1_plus_~a#1_Out_6| |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|)) (.cse11 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|))) (or (and .cse0 .cse1 (= |v_thread1Thread1of1ForFork1_#t~ret5#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~bag1~0_Out_2) .cse2 (= v_~sum1~0_Out_6 v_~sum1~0_In_5) .cse3 (< |v_thread1Thread1of1ForFork1_plus_#res#1_In_1| v_~cap1~0_In_1) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| .cse4) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem6#1_In_1| |v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|) .cse6 .cse7 (= v_~bag1~0_In_5 |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|) .cse8 .cse9 .cse10 .cse11) (and (= |v_thread1Thread1of1ForFork1_#t~ret4#1_In_1| |v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|) .cse0 (= .cse4 v_~bag1~0_Out_2) .cse1 .cse2 .cse3 (<= v_~cap1~0_In_1 |v_thread1Thread1of1ForFork1_plus_#res#1_In_1|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_Out_14| v_~sum1~0_Out_6) .cse5 (= |v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2| |v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6| v_~bag1~0_In_5) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6| v_~sum1~0_In_5)))))) InVars {~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_In_7, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_In_1|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_In_1|, ~bag1~0=v_~bag1~0_In_5, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_In_5, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_In_1|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_In_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~post7#1=|v_thread1Thread1of1ForFork1_#t~post7#1_Out_2|, ~A~0.base=v_~A~0.base_In_3, ~i~0=v_~i~0_Out_2, thread1Thread1of1ForFork1_#t~mem6#1=|v_thread1Thread1of1ForFork1_#t~mem6#1_Out_2|, thread1Thread1of1ForFork1_#t~ret4#1=|v_thread1Thread1of1ForFork1_#t~ret4#1_Out_2|, ~bag1~0=v_~bag1~0_Out_2, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_Out_6|, ~A~0.offset=v_~A~0.offset_In_3, ~sum1~0=v_~sum1~0_Out_6, thread1Thread1of1ForFork1_#t~ret5#1=|v_thread1Thread1of1ForFork1_#t~ret5#1_Out_2|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, #valid=|v_#valid_In_7|, ~cap1~0=v_~cap1~0_In_1, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_Out_2|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_Out_6|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_Out_6|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_Out_14|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_18|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7#1, ~i~0, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~ret4#1, ~bag1~0, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, ~sum1~0, thread1Thread1of1ForFork1_#t~ret5#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_plus_#res#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 689#[L46-1, L97-4]don't care [2022-07-22 12:19:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 49445728, now seen corresponding path program 1 times [2022-07-22 12:19:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:29,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886632322] [2022-07-22 12:19:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:29,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:29,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 51360, now seen corresponding path program 2 times [2022-07-22 12:19:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744032146] [2022-07-22 12:19:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:29,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:29,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 272754751, now seen corresponding path program 1 times [2022-07-22 12:19:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:29,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218788623] [2022-07-22 12:19:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:29,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:29,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:31,538 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:19:31,539 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:19:31,539 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:19:31,539 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:19:31,539 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:19:31,539 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:31,539 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:19:31,539 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:19:31,540 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-1.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 12:19:31,540 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:19:31,540 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:19:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,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:19:31,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:19:31,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:31,793 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:19:31,799 INFO L158 Benchmark]: Toolchain (without parser) took 20491.05ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 138.3MB in the beginning and 62.8MB in the end (delta: 75.5MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. [2022-07-22 12:19:31,799 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 163.6MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:19:31,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.24ms. Allocated memory is still 163.6MB. Free memory was 138.1MB in the beginning and 126.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:19:31,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.33ms. Allocated memory is still 163.6MB. Free memory was 126.2MB in the beginning and 123.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-07-22 12:19:31,804 INFO L158 Benchmark]: Boogie Preprocessor took 44.44ms. Allocated memory is still 163.6MB. Free memory was 123.7MB in the beginning and 121.8MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:19:31,804 INFO L158 Benchmark]: RCFGBuilder took 918.19ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 133.0MB in the end (delta: -11.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-07-22 12:19:31,806 INFO L158 Benchmark]: BuchiAutomizer took 19107.76ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 133.0MB in the beginning and 62.8MB in the end (delta: 70.2MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. [2022-07-22 12:19:31,810 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.25ms. Allocated memory is still 163.6MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 349.24ms. Allocated memory is still 163.6MB. Free memory was 138.1MB in the beginning and 126.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.33ms. Allocated memory is still 163.6MB. Free memory was 126.2MB in the beginning and 123.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.44ms. Allocated memory is still 163.6MB. Free memory was 123.7MB in the beginning and 121.8MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 918.19ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 133.0MB in the end (delta: -11.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 19107.76ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 133.0MB in the beginning and 62.8MB in the end (delta: 70.2MB). Peak memory consumption was 113.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9s, 354 PlacesBefore, 20 PlacesAfterwards, 375 TransitionsBefore, 17 TransitionsAfterwards, 35532 CoEnabledTransitionPairs, 7 FixpointIterations, 99 TrivialSequentialCompositions, 238 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 68 ConcurrentYvCompositions, 24 ChoiceCompositions, 448 TotalNumberOfCompositions, 28625 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28193, positive: 28170, positive conditional: 0, positive unconditional: 28170, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25558, positive: 25541, positive conditional: 0, positive unconditional: 25541, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25558, positive: 25541, positive conditional: 0, positive unconditional: 25541, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28193, positive: 2629, positive conditional: 0, positive unconditional: 2629, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 25558, unknown conditional: 0, unknown unconditional: 25558] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:19:31,855 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...