/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-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:54:12,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:54:12,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:54:12,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:54:12,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:54:12,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:54:12,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:54:12,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:54:12,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:54:12,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:54:12,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:54:12,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:54:12,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:54:12,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:54:12,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:54:12,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:54:12,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:54:12,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:54:12,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:54:12,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:54:12,819 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:54:12,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:54:12,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:54:12,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:54:12,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:54:12,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:54:12,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:54:12,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:54:12,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:54:12,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:54:12,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:54:12,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:54:12,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:54:12,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:54:12,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:54:12,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:54:12,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:54:12,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:54:12,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:54:12,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:54:12,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:54:12,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:54:12,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 11:54:12,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:54:12,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:54:12,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:54:12,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:54:12,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:54:12,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:54:12,911 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:54:12,911 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:54:12,911 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:54:12,911 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:54:12,912 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:54:12,912 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:54:12,912 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:54:12,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:54:12,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:54:12,913 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:54:12,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:54:12,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:54:12,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:54:12,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:54:12,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:54:12,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:54:12,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:54:12,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:54:12,914 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:54:12,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:54:12,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:54:12,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:54:12,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:54:12,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:54:12,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:54:12,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:54:12,917 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:54:12,917 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 11:54:13,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:54:13,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:54:13,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:54:13,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:54:13,333 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:54:13,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-22 11:54:13,417 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9870f0c/2a0fb61312dc4ca28b04046817958ab1/FLAG04fcb011c [2022-07-22 11:54:14,164 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:54:14,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-22 11:54:14,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9870f0c/2a0fb61312dc4ca28b04046817958ab1/FLAG04fcb011c [2022-07-22 11:54:14,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9870f0c/2a0fb61312dc4ca28b04046817958ab1 [2022-07-22 11:54:14,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:54:14,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:54:14,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:54:14,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:54:14,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:54:14,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119c2fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14, skipping insertion in model container [2022-07-22 11:54:14,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:54:14,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:54:14,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2022-07-22 11:54:14,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:54:14,743 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:54:14,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2022-07-22 11:54:14,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:54:14,798 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:54:14,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14 WrapperNode [2022-07-22 11:54:14,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:54:14,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:54:14,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:54:14,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:54:14,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,889 INFO L137 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-07-22 11:54:14,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:54:14,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:54:14,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:54:14,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:54:14,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:54:14,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:54:14,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:54:14,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:54:14,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (1/1) ... [2022-07-22 11:54:14,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:14,997 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 11:54:15,026 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 11:54:15,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:54:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:54:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:54:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:54:15,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 11:54:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 11:54:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 11:54:15,101 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 11:54:15,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:54:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 11:54:15,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 11:54:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 11:54:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:54:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:54:15,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:54:15,106 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 11:54:15,268 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:54:15,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:54:15,650 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:54:15,818 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:54:15,822 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 11:54:15,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:54:15 BoogieIcfgContainer [2022-07-22 11:54:15,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:54:15,827 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:54:15,828 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:54:15,838 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:54:15,839 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:54:15,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:54:14" (1/3) ... [2022-07-22 11:54:15,841 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd29b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:54:15, skipping insertion in model container [2022-07-22 11:54:15,841 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:54:15,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:54:14" (2/3) ... [2022-07-22 11:54:15,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd29b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:54:15, skipping insertion in model container [2022-07-22 11:54:15,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:54:15,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:54:15" (3/3) ... [2022-07-22 11:54:15,846 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2022-07-22 11:54:16,026 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 11:54:16,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 116 transitions, 248 flow [2022-07-22 11:54:16,150 INFO L129 PetriNetUnfolder]: 9/112 cut-off events. [2022-07-22 11:54:16,150 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 11:54:16,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 9/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-07-22 11:54:16,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 116 transitions, 248 flow [2022-07-22 11:54:16,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 112 transitions, 236 flow [2022-07-22 11:54:16,180 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:54:16,180 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:54:16,180 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:54:16,181 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:54:16,181 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:54:16,181 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:54:16,181 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:54:16,181 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:54:16,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:54:16,370 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 311 [2022-07-22 11:54:16,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:54:16,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:54:16,378 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:54:16,378 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:54:16,379 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:54:16,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 479 states, but on-demand construction may add more states [2022-07-22 11:54:16,397 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 311 [2022-07-22 11:54:16,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:54:16,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:54:16,400 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:54:16,400 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 11:54:16,408 INFO L748 eck$LassoCheckResult]: Stem: 115#[ULTIMATE.startENTRY]don't care [378] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 118#[L-1]don't care [309] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 120#[L-1-1]don't care [387] L-1-1-->L-1-2: Formula: (= (select |v_#valid_18| 0) 0) InVars {#valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|} AuxVars[] AssignedVars[] 122#[L-1-2]don't care [390] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_4|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|} AuxVars[] AssignedVars[] 124#[L21]don't care [358] L21-->L21-1: Formula: (and (= 2 (select |v_#length_14| 1)) (= (select |v_#valid_19| 1) 1)) InVars {#length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_14|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 126#[L21-1]don't care [373] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 128#[L21-2]don't care [316] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 130#[L21-3]don't care [351] L21-3-->L21-4: Formula: (and (= (select |v_#valid_20| 2) 1) (= 32 (select |v_#length_15| 2))) InVars {#length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_15|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 132#[L21-4]don't care [329] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 134#[L42]don't care [323] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 136#[L42-1]don't care [376] L42-1-->L-1-3: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 138#[L-1-3]don't care [395] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 140#[L-1-4]don't care [313] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 142#[L-1-5]don't care [296] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 144#[L-1-6]don't care [368] L-1-6-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_3|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 146#[L69]don't care [295] L69-->L69-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1| 4) |v_#length_3|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_1| 0)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 148#[L69-1]don't care [391] L69-1-->L69-2: Formula: (and (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1| 1)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_1| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1| 4) |v_#length_5|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 150#[L69-2]don't care [359] L69-2-->L71: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 152#[L71]don't care [344] L71-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 154#[L72]don't care [332] L72-->L72-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 156#[L72-1]don't care [337] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_6) InVars {~N~0=v_~N~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 158#[L72-2]don't care [288] L72-2-->L72-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 160#[L72-3]don't care [311] L72-3-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 162#[L86]don't care [284] L86-->L87: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 164#[L87]don't care [322] L87-->L87-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 166#[L87-1]don't care [290] L87-1-->L87-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 168#[L87-2]don't care [287] L87-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 170#[L37]don't care [324] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 172#[L38]don't care [331] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 176#[L37-1]don't care [325] L37-1-->L88: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 178#[L88]don't care [355] L88-->L88-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 180#[L88-1]don't care [370] L88-1-->L88-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 182#[L88-2]don't care [294] L88-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 184#[L37-2]don't care [297] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 186#[L38-3]don't care [308] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 190#[L37-3]don't care [304] L37-3-->L90: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 192#[L90]don't care [381] L90-->L90-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| 0)) (= (store |v_#valid_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| 1) |v_#valid_7|) (= (store |v_#length_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_2|, #valid=|v_#valid_7|, #length=|v_#length_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, #valid, #length] 194#[L90-1]don't care [300] L90-1-->L90-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 196#[L90-2]don't care [305] L90-2-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset] 198#[L91]don't care [301] L91-->L91-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 200#[L91-6]don't care [2022-07-22 11:54:16,409 INFO L750 eck$LassoCheckResult]: Loop: 200#[L91-6]don't care [384] L91-6-->L92: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 202#[L92]don't care [366] L92-->L92-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|)) |v_#memory_int_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 206#[L92-1]don't care [361] L92-1-->L91-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1] 210#[L91-3]don't care [389] L91-3-->L91-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1] 214#[L91-4]don't care [293] L91-4-->L91-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 218#[L91-5]don't care [286] L91-5-->L91-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1] 200#[L91-6]don't care [2022-07-22 11:54:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash 656611012, now seen corresponding path program 1 times [2022-07-22 11:54:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:16,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470412045] [2022-07-22 11:54:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:16,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:16,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:16,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:16,653 INFO L85 PathProgramCache]: Analyzing trace with hash -654657788, now seen corresponding path program 1 times [2022-07-22 11:54:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:16,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253988183] [2022-07-22 11:54:16,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:16,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:16,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash -296456313, now seen corresponding path program 1 times [2022-07-22 11:54:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:16,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300226360] [2022-07-22 11:54:16,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:16,734 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:16,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:18,043 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:54:18,044 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:54:18,044 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:54:18,044 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:54:18,045 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:54:18,045 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:18,045 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:54:18,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:54:18,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue2.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 11:54:18,046 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:54:18,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:54:18,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:18,939 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:54:18,946 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:54:18,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:18,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:18,950 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 11:54:18,959 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 11:54:18,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:18,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:18,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:18,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:18,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:18,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:18,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:18,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:18,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,014 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 11:54:19,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,017 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 11:54:19,021 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 11:54:19,025 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 11:54:19,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,086 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 11:54:19,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,088 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 11:54:19,094 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 11:54:19,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,110 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 11:54:19,119 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,156 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 11:54:19,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,158 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 11:54:19,161 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 11:54:19,161 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 11:54:19,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,218 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 11:54:19,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,221 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 11:54:19,226 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 11:54:19,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,238 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 11:54:19,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,286 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 11:54:19,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,288 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 11:54:19,296 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 11:54:19,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,314 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 11:54:19,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,361 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 11:54:19,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,363 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 11:54:19,368 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 11:54:19,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,385 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 11:54:19,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,432 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 11:54:19,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,434 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 11:54:19,438 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 11:54:19,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,453 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 11:54:19,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,495 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 11:54:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,498 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 11:54:19,499 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 11:54:19,500 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 11:54:19,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:19,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,541 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 11:54:19,543 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 11:54:19,545 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 11:54:19,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,609 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 11:54:19,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,611 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 11:54:19,622 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 11:54:19,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,634 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 11:54:19,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,677 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 11:54:19,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,679 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 11:54:19,681 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 11:54:19,681 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 11:54:19,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,733 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 11:54:19,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,735 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 11:54:19,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:19,745 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 11:54:19,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:19,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:19,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,801 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 11:54:19,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,802 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 11:54:19,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:19,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,819 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 11:54:19,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,863 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 11:54:19,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,865 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 11:54:19,871 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 11:54:19,875 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 11:54:19,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,915 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 11:54:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,917 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 11:54:19,918 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 11:54:19,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:19,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:19,951 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 11:54:19,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:19,953 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 11:54:19,955 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 11:54:19,955 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 11:54:19,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:19,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:19,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:19,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:19,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:19,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:19,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:19,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,011 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 11:54:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,012 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 11:54:20,013 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 11:54:20,014 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 11:54:20,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,057 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 11:54:20,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,059 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 11:54:20,063 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 11:54:20,064 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 11:54:20,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:20,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,100 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 11:54:20,103 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 11:54:20,104 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 11:54:20,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,172 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 11:54:20,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,175 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 11:54:20,181 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 11:54:20,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:20,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:20,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:20,193 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 11:54:20,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,237 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 11:54:20,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,240 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 11:54:20,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 11:54:20,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:20,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:20,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:20,257 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 11:54:20,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,302 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 11:54:20,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,303 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 11:54:20,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:54:20,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:20,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:20,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:20,342 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 11:54:20,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,375 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 11:54:20,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,377 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 11:54:20,378 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 11:54:20,378 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 11:54:20,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:54:20,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:54:20,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:54:20,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 11:54:20,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,410 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 11:54:20,411 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 11:54:20,415 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 11:54:20,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,432 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,454 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 11:54:20,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,455 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 11:54:20,457 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 11:54:20,458 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 11:54:20,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 11:54:20,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,494 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 11:54:20,495 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 11:54:20,495 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 11:54:20,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 11:54:20,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,538 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 11:54:20,541 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 11:54:20,542 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 11:54:20,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:54:20,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 11:54:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,591 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 11:54:20,592 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 11:54:20,593 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 11:54:20,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:54:20,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:54:20,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:54:20,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:54:20,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:54:20,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:54:20,626 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:54:20,658 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 11:54:20,658 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-07-22 11:54:20,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:54:20,670 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 11:54:20,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:54:20,685 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 11:54:20,694 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 11:54:20,695 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:54:20,696 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~2#1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 Supporting invariants [] [2022-07-22 11:54:20,737 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 11:54:20,841 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 11:54:20,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:54:20,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:54:20,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:54:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:54:20,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:54:20,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:54:21,067 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 11:54:21,110 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-22 11:54:21,114 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 479 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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 11:54:21,364 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 479 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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) Result 1353 states and 3474 transitions. Complement of second has 9 states. [2022-07-22 11:54:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:54:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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 11:54:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2022-07-22 11:54:21,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 188 transitions. Stem has 40 letters. Loop has 6 letters. [2022-07-22 11:54:21,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:54:21,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 188 transitions. Stem has 46 letters. Loop has 6 letters. [2022-07-22 11:54:21,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:54:21,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 188 transitions. Stem has 40 letters. Loop has 12 letters. [2022-07-22 11:54:21,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:54:21,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1353 states and 3474 transitions. [2022-07-22 11:54:21,406 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 305 [2022-07-22 11:54:21,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1353 states to 418 states and 996 transitions. [2022-07-22 11:54:21,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2022-07-22 11:54:21,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2022-07-22 11:54:21,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 996 transitions. [2022-07-22 11:54:21,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:54:21,428 INFO L220 hiAutomatonCegarLoop]: Abstraction has 418 states and 996 transitions. [2022-07-22 11:54:21,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 996 transitions. [2022-07-22 11:54:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 417. [2022-07-22 11:54:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 417 states have (on average 2.386091127098321) internal successors, (995), 416 states have internal predecessors, (995), 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 11:54:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 995 transitions. [2022-07-22 11:54:21,515 INFO L242 hiAutomatonCegarLoop]: Abstraction has 417 states and 995 transitions. [2022-07-22 11:54:21,516 INFO L425 stractBuchiCegarLoop]: Abstraction has 417 states and 995 transitions. [2022-07-22 11:54:21,516 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:54:21,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 995 transitions. [2022-07-22 11:54:21,521 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 305 [2022-07-22 11:54:21,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:54:21,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:54:21,528 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:54:21,528 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:54:21,532 INFO L748 eck$LassoCheckResult]: Stem: 3482#[ULTIMATE.startENTRY]don't care [378] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3472#[L-1]don't care [309] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 3474#[L-1-1]don't care [387] L-1-1-->L-1-2: Formula: (= (select |v_#valid_18| 0) 0) InVars {#valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|} AuxVars[] AssignedVars[] 3484#[L-1-2]don't care [390] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_4|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|} AuxVars[] AssignedVars[] 3456#[L21]don't care [358] L21-->L21-1: Formula: (and (= 2 (select |v_#length_14| 1)) (= (select |v_#valid_19| 1) 1)) InVars {#length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_14|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 3398#[L21-1]don't care [373] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 3298#[L21-2]don't care [316] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 3300#[L21-3]don't care [351] L21-3-->L21-4: Formula: (and (= (select |v_#valid_20| 2) 1) (= 32 (select |v_#length_15| 2))) InVars {#length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_15|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 2898#[L21-4]don't care [329] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 2900#[L42]don't care [323] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 3446#[L42-1]don't care [376] L42-1-->L-1-3: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 3400#[L-1-3]don't care [395] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2868#[L-1-4]don't care [313] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2870#[L-1-5]don't care [296] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 3392#[L-1-6]don't care [368] L-1-6-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_3|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 2732#[L69]don't care [295] L69-->L69-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1| 4) |v_#length_3|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_1| 0)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 2734#[L69-1]don't care [391] L69-1-->L69-2: Formula: (and (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1| 1)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_1| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1| 4) |v_#length_5|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 3124#[L69-2]don't care [359] L69-2-->L71: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 2918#[L71]don't care [344] L71-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 2920#[L72]don't care [332] L72-->L72-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3326#[L72-1]don't care [337] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_6) InVars {~N~0=v_~N~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 3328#[L72-2]don't care [288] L72-2-->L72-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 3468#[L72-3]don't care [311] L72-3-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 3466#[L86]don't care [284] L86-->L87: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 3440#[L87]don't care [322] L87-->L87-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3442#[L87-1]don't care [290] L87-1-->L87-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2680#[L87-2]don't care [287] L87-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2682#[L37]don't care [324] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2886#[L38]don't care [331] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 3478#[L37-1]don't care [325] L37-1-->L88: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2996#[L88]don't care [355] L88-->L88-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2998#[L88-1]don't care [370] L88-1-->L88-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3072#[L88-2]don't care [294] L88-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 3420#[L37-2]don't care [297] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2824#[L38-3]don't care [308] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 2826#[L37-3]don't care [304] L37-3-->L90: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3430#[L90]don't care [381] L90-->L90-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| 0)) (= (store |v_#valid_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| 1) |v_#valid_7|) (= (store |v_#length_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_2|, #valid=|v_#valid_7|, #length=|v_#length_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, #valid, #length] 3458#[L90-1]don't care [300] L90-1-->L90-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 3256#[L90-2]don't care [305] L90-2-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset] 3230#[L91]don't care [301] L91-->L91-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 3232#[L91-6]don't care [383] L91-6-->L91-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 3096#[L91-7]don't care [388] L91-7-->L94: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 3078#[L94]don't care [377] L94-->L72-4: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|) (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 3080#[L72-4]don't care [392] L72-4-->L72-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3130#[L72-5]don't care [343] L72-5-->L72-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 3336#[L72-6]don't care [318] L72-6-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 3436#[L75]don't care [326] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 3248#[L75-1]don't care [303] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 3074#[L75-2]don't care [372] L75-2-->L75-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) |v_ULTIMATE.start_main_~#t1~0#1.offset_2| |v_ULTIMATE.start_main_#t~pre9#1_2|)) |v_#memory_int_5|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 4) (select |v_#length_10| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_2|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|} AuxVars[] AssignedVars[#memory_int] 3076#[L75-3]don't care [421] L75-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 3464#[thread1ENTRY, L75-4]don't care [396] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 2784#[L49-4, L75-4]don't care [2022-07-22 11:54:21,532 INFO L750 eck$LassoCheckResult]: Loop: 2784#[L49-4, L75-4]don't care [399] L49-4-->L50: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 3476#[L50, L75-4]don't care [401] L50-->L52: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_23)) (.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| v_~counter~0_46) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_23 4) (select |v_#length_34| v_~A~0.base_23)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| v_~counter~0_45) (= (select |v_#valid_39| v_~A~0.base_23) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (or (<= .cse2 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_31| v_~A~0.base_23) .cse0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| |v_thread1Thread1of1ForFork1_plus_~a#1_1|) (= .cse2 |v_thread1Thread1of1ForFork1_plus_#res#1_1|)))) InVars {~counter~0=v_~counter~0_46, ~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|} OutVars{~counter~0=v_~counter~0_45, ~A~0.base=v_~A~0.base_23, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 3194#[L52, L75-4]don't care [403] L52-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_9|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 3196#[L49-2, L75-4]don't care [404] L49-2-->L49-3: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_11| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_11|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 2782#[L49-3, L75-4]don't care [405] L49-3-->L49-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 2784#[L49-4, L75-4]don't care [2022-07-22 11:54:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1176460365, now seen corresponding path program 1 times [2022-07-22 11:54:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:21,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160178345] [2022-07-22 11:54:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:21,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:21,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:21,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 409460433, now seen corresponding path program 1 times [2022-07-22 11:54:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:21,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115045602] [2022-07-22 11:54:21,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:21,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:21,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:21,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash -533480865, now seen corresponding path program 1 times [2022-07-22 11:54:21,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:21,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653145316] [2022-07-22 11:54:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:21,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:54:21,962 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 11:54:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:54:21,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653145316] [2022-07-22 11:54:21,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653145316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:54:21,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:54:21,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 11:54:21,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284255624] [2022-07-22 11:54:21,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:54:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:54:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 11:54:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:54:22,133 INFO L87 Difference]: Start difference. First operand 417 states and 995 transitions. cyclomatic complexity: 624 Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 11:54:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:54:22,282 INFO L93 Difference]: Finished difference Result 622 states and 1458 transitions. [2022-07-22 11:54:22,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 622 states and 1458 transitions. [2022-07-22 11:54:22,290 INFO L131 ngComponentsAnalysis]: Automaton has 68 accepting balls. 420 [2022-07-22 11:54:22,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 622 states to 598 states and 1404 transitions. [2022-07-22 11:54:22,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 588 [2022-07-22 11:54:22,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 588 [2022-07-22 11:54:22,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 598 states and 1404 transitions. [2022-07-22 11:54:22,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:54:22,308 INFO L220 hiAutomatonCegarLoop]: Abstraction has 598 states and 1404 transitions. [2022-07-22 11:54:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states and 1404 transitions. [2022-07-22 11:54:22,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 486. [2022-07-22 11:54:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 486 states have (on average 2.3868312757201644) internal successors, (1160), 485 states have internal predecessors, (1160), 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 11:54:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1160 transitions. [2022-07-22 11:54:22,381 INFO L242 hiAutomatonCegarLoop]: Abstraction has 486 states and 1160 transitions. [2022-07-22 11:54:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 11:54:22,390 INFO L425 stractBuchiCegarLoop]: Abstraction has 486 states and 1160 transitions. [2022-07-22 11:54:22,390 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 11:54:22,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 486 states and 1160 transitions. [2022-07-22 11:54:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 345 [2022-07-22 11:54:22,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:54:22,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:54:22,398 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:54:22,398 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:54:22,402 INFO L748 eck$LassoCheckResult]: Stem: 5014#[ULTIMATE.startENTRY]don't care [378] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4996#[L-1]don't care [309] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 4998#[L-1-1]don't care [387] L-1-1-->L-1-2: Formula: (= (select |v_#valid_18| 0) 0) InVars {#valid=|v_#valid_18|} OutVars{#valid=|v_#valid_18|} AuxVars[] AssignedVars[] 5018#[L-1-2]don't care [390] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_4|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|} AuxVars[] AssignedVars[] 4968#[L21]don't care [358] L21-->L21-1: Formula: (and (= 2 (select |v_#length_14| 1)) (= (select |v_#valid_19| 1) 1)) InVars {#length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#length=|v_#length_14|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[] 4894#[L21-1]don't care [373] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_11| 1) 0) 48) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] 4786#[L21-2]don't care [316] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_12| 1) 1) 0) InVars {#memory_int=|v_#memory_int_12|} OutVars{#memory_int=|v_#memory_int_12|} AuxVars[] AssignedVars[] 4788#[L21-3]don't care [351] L21-3-->L21-4: Formula: (and (= (select |v_#valid_20| 2) 1) (= 32 (select |v_#length_15| 2))) InVars {#length=|v_#length_15|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_15|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 4368#[L21-4]don't care [329] L21-4-->L42: Formula: (and (= v_~A~0.base_4 0) (= v_~A~0.offset_4 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_4, ~A~0.offset=v_~A~0.offset_4} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 4370#[L42]don't care [323] L42-->L42-1: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] 4954#[L42-1]don't care [376] L42-1-->L-1-3: Formula: (= v_~N~0_7 0) InVars {} OutVars{~N~0=v_~N~0_7} AuxVars[] AssignedVars[~N~0] 4904#[L-1-3]don't care [395] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4338#[L-1-4]don't care [313] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4340#[L-1-5]don't care [296] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 4886#[L-1-6]don't care [368] L-1-6-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_3|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_4|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_3|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~ret8#1.base, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 4206#[L69]don't care [295] L69-->L69-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1| 4) |v_#length_3|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_1| 0)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 4208#[L69-1]don't care [391] L69-1-->L69-2: Formula: (and (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1| 1)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_1| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_1| 4) |v_#length_5|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 4610#[L69-2]don't care [359] L69-2-->L71: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 4390#[L71]don't care [344] L71-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] 4392#[L72]don't care [332] L72-->L72-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4814#[L72-1]don't care [337] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_6) InVars {~N~0=v_~N~0_6} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] 4816#[L72-2]don't care [288] L72-2-->L72-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 4988#[L72-3]don't care [311] L72-3-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet17#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post16#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] 4984#[L86]don't care [284] L86-->L87: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] 4948#[L87]don't care [322] L87-->L87-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4950#[L87-1]don't care [290] L87-1-->L87-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4156#[L87-2]don't care [287] L87-2-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 4158#[L37]don't care [324] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 4356#[L38]don't care [331] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 5006#[L37-1]don't care [325] L37-1-->L88: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4468#[L88]don't care [355] L88-->L88-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4470#[L88-1]don't care [370] L88-1-->L88-2: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4550#[L88-2]don't care [294] L88-2-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 4928#[L37-2]don't care [297] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 4294#[L38-3]don't care [308] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] 4296#[L37-3]don't care [304] L37-3-->L90: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4938#[L90]don't care [381] L90-->L90-1: Formula: (and (= (select |v_#valid_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| |v_#StackHeapBarrier_3|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_2| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| 0)) (= (store |v_#valid_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| 1) |v_#valid_7|) (= (store |v_#length_8| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 4)) |v_#length_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_2|, #valid=|v_#valid_7|, #length=|v_#length_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset, #valid, #length] 4972#[L90-1]don't care [300] L90-1-->L90-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] 4744#[L90-2]don't care [305] L90-2-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc15#1.offset] 4718#[L91]don't care [301] L91-->L91-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 4572#[L91-6]don't care [384] L91-6-->L92: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4| |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[] 4530#[L92]don't care [366] L92-->L92-1: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|)) |v_#memory_int_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1 4) (select |v_#length_9| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|))))) InVars {ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[#memory_int] 4532#[L92-1]don't care [361] L92-1-->L91-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet17#1] 4596#[L91-3]don't care [389] L91-3-->L91-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1] 4598#[L91-4]don't care [293] L91-4-->L91-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_3|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] 4922#[L91-5]don't care [286] L91-5-->L91-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post16#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post16#1] 4924#[L91-6]don't care [383] L91-6-->L91-7: Formula: (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] 5076#[L91-7]don't care [388] L91-7-->L94: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] 5074#[L94]don't care [377] L94-->L72-4: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3| |v_ULTIMATE.start_main_#t~ret8#1.offset_1|) (= |v_ULTIMATE.start_main_#t~ret8#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 5072#[L72-4]don't care [392] L72-4-->L72-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5070#[L72-5]don't care [343] L72-5-->L72-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret8#1.base_2| v_~A~0.base_3) (= v_~A~0.offset_3 |v_ULTIMATE.start_main_#t~ret8#1.offset_2|)) InVars {ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} OutVars{~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_2|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_2|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset] 5068#[L72-6]don't care [318] L72-6-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret8#1.offset=|v_ULTIMATE.start_main_#t~ret8#1.offset_3|, ULTIMATE.start_main_#t~ret8#1.base=|v_ULTIMATE.start_main_#t~ret8#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret8#1.offset, ULTIMATE.start_main_#t~ret8#1.base] 5066#[L75]don't care [326] L75-->L75-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 5064#[L75-1]don't care [303] L75-1-->L75-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 5062#[L75-2]don't care [372] L75-2-->L75-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) |v_ULTIMATE.start_main_~#t1~0#1.offset_2| |v_ULTIMATE.start_main_#t~pre9#1_2|)) |v_#memory_int_5|) (= (select |v_#valid_10| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 4) (select |v_#length_10| |v_ULTIMATE.start_main_~#t1~0#1.base_2|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_2|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|} AuxVars[] AssignedVars[#memory_int] 5060#[L75-3]don't care [421] L75-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 5058#[thread1ENTRY, L75-4]don't care [396] thread1ENTRY-->L49-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 4256#[L49-4, L75-4]don't care [2022-07-22 11:54:22,402 INFO L750 eck$LassoCheckResult]: Loop: 4256#[L49-4, L75-4]don't care [399] L49-4-->L50: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_5| v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 5004#[L50, L75-4]don't care [401] L50-->L52: Formula: (let ((.cse1 (* |v_thread1Thread1of1ForFork1_~i~0#1_7| 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_23)) (.cse2 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 .cse0) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| v_~counter~0_46) (not (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (<= (+ .cse1 v_~A~0.offset_23 4) (select |v_#length_34| v_~A~0.base_23)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_1| v_~counter~0_45) (= (select |v_#valid_39| v_~A~0.base_23) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (or (<= .cse2 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| (select (select |v_#memory_int_31| v_~A~0.base_23) .cse0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_1| |v_thread1Thread1of1ForFork1_plus_~b#1_1|) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| |v_thread1Thread1of1ForFork1_plus_~a#1_1|) (= .cse2 |v_thread1Thread1of1ForFork1_plus_#res#1_1|)))) InVars {~counter~0=v_~counter~0_46, ~A~0.base=v_~A~0.base_23, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|} OutVars{~counter~0=v_~counter~0_45, ~A~0.base=v_~A~0.base_23, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_1|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.offset=v_~A~0.offset_23, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_7|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_31|, #length=|v_#length_34|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 4678#[L52, L75-4]don't care [403] L52-->L49-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_9|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 4680#[L49-2, L75-4]don't care [404] L49-2-->L49-3: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_11| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_11|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 4254#[L49-3, L75-4]don't care [405] L49-3-->L49-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 4256#[L49-4, L75-4]don't care [2022-07-22 11:54:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 658064144, now seen corresponding path program 1 times [2022-07-22 11:54:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:22,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188031777] [2022-07-22 11:54:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:22,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 11:54:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:22,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:22,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash 409460433, now seen corresponding path program 2 times [2022-07-22 11:54:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192466973] [2022-07-22 11:54:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:22,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:22,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:54:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -82236126, now seen corresponding path program 1 times [2022-07-22 11:54:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:54:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943193156] [2022-07-22 11:54:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:54:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:54:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:22,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:54:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:54:22,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:54:24,219 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:54:24,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:54:24,219 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:54:24,219 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:54:24,219 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:54:24,219 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:54:24,220 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:54:24,220 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:54:24,220 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-bad-counter-queue2.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 11:54:24,220 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:54:24,220 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:54:24,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:54:24,485 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 11:54:24,495 INFO L158 Benchmark]: Toolchain (without parser) took 10007.19ms. Allocated memory was 162.5MB in the beginning and 204.5MB in the end (delta: 41.9MB). Free memory was 138.1MB in the beginning and 166.5MB in the end (delta: -28.3MB). Peak memory consumption was 118.0MB. Max. memory is 8.0GB. [2022-07-22 11:54:24,496 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 162.5MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 11:54:24,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.13ms. Allocated memory is still 162.5MB. Free memory was 137.9MB in the beginning and 127.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 11:54:24,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.76ms. Allocated memory is still 162.5MB. Free memory was 127.0MB in the beginning and 125.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:54:24,500 INFO L158 Benchmark]: Boogie Preprocessor took 46.66ms. Allocated memory is still 162.5MB. Free memory was 125.0MB in the beginning and 123.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 11:54:24,500 INFO L158 Benchmark]: RCFGBuilder took 884.41ms. Allocated memory is still 162.5MB. Free memory was 123.5MB in the beginning and 137.8MB in the end (delta: -14.2MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2022-07-22 11:54:24,501 INFO L158 Benchmark]: BuchiAutomizer took 8662.25ms. Allocated memory was 162.5MB in the beginning and 204.5MB in the end (delta: 41.9MB). Free memory was 137.3MB in the beginning and 166.5MB in the end (delta: -29.2MB). Peak memory consumption was 117.1MB. Max. memory is 8.0GB. [2022-07-22 11:54:24,513 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 162.5MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.13ms. Allocated memory is still 162.5MB. Free memory was 137.9MB in the beginning and 127.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 90.76ms. Allocated memory is still 162.5MB. Free memory was 127.0MB in the beginning and 125.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.66ms. Allocated memory is still 162.5MB. Free memory was 125.0MB in the beginning and 123.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 884.41ms. Allocated memory is still 162.5MB. Free memory was 123.5MB in the beginning and 137.8MB in the end (delta: -14.2MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 8662.25ms. Allocated memory was 162.5MB in the beginning and 204.5MB in the end (delta: 41.9MB). Free memory was 137.3MB in the beginning and 166.5MB in the end (delta: -29.2MB). Peak memory consumption was 117.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - 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 11:54:24,559 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...