/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:52:08,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:52:08,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:52:08,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:52:08,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:52:08,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:52:08,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:52:08,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:52:08,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:52:08,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:52:08,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:52:08,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:52:08,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:52:08,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:52:08,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:52:08,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:52:08,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:52:08,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:52:08,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:52:08,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:52:08,955 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:52:08,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:52:08,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:52:08,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:52:08,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:52:08,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:52:08,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:52:08,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:52:08,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:52:08,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:52:08,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:52:08,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:52:08,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:52:08,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:52:08,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:52:08,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:52:08,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:52:08,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:52:08,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:52:08,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:52:08,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:52:08,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:52:08,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:52:09,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:52:09,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:52:09,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:52:09,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:52:09,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:52:09,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:52:09,041 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:52:09,041 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:52:09,041 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:52:09,041 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:52:09,042 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:52:09,042 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:52:09,042 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:52:09,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:52:09,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:52:09,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:52:09,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:52:09,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:52:09,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:52:09,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:52:09,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:52:09,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:52:09,044 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:52:09,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:52:09,044 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:52:09,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:52:09,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:52:09,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:52:09,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:52:09,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:52:09,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:52:09,046 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:52:09,047 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:52:09,047 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:52:09,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:52:09,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:52:09,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:52:09,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:52:09,434 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:52:09,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2022-07-22 12:52:09,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46411a42/f420921ac0f6441499a7e84468e96883/FLAG5d7bc31e4 [2022-07-22 12:52:10,069 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:52:10,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2022-07-22 12:52:10,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46411a42/f420921ac0f6441499a7e84468e96883/FLAG5d7bc31e4 [2022-07-22 12:52:10,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46411a42/f420921ac0f6441499a7e84468e96883 [2022-07-22 12:52:10,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:52:10,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:52:10,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:52:10,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:52:10,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:52:10,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474d45e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10, skipping insertion in model container [2022-07-22 12:52:10,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:52:10,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:52:10,703 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/unroll-cond-2.wvr.c[2474,2487] [2022-07-22 12:52:10,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:52:10,719 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:52:10,744 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/unroll-cond-2.wvr.c[2474,2487] [2022-07-22 12:52:10,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:52:10,765 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:52:10,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10 WrapperNode [2022-07-22 12:52:10,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:52:10,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:52:10,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:52:10,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:52:10,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,815 INFO L137 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 139 [2022-07-22 12:52:10,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:52:10,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:52:10,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:52:10,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:52:10,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:52:10,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:52:10,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:52:10,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:52:10,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (1/1) ... [2022-07-22 12:52:10,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:10,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:10,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:10,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:52:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:52:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:52:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:52:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:52:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:52:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:52:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:52:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:52:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:52:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:52:11,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:52:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:52:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:52:11,009 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:52:11,112 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:52:11,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:52:11,390 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:52:11,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:52:11,403 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:52:11,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:52:11 BoogieIcfgContainer [2022-07-22 12:52:11,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:52:11,408 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:52:11,408 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:52:11,412 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:52:11,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:52:11,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:52:10" (1/3) ... [2022-07-22 12:52:11,415 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd94f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:52:11, skipping insertion in model container [2022-07-22 12:52:11,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:52:11,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:52:10" (2/3) ... [2022-07-22 12:52:11,416 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1bd94f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:52:11, skipping insertion in model container [2022-07-22 12:52:11,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:52:11,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:52:11" (3/3) ... [2022-07-22 12:52:11,417 INFO L322 chiAutomizerObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2022-07-22 12:52:11,600 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:52:11,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 168 places, 178 transitions, 372 flow [2022-07-22 12:52:11,737 INFO L129 PetriNetUnfolder]: 15/174 cut-off events. [2022-07-22 12:52:11,738 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:52:11,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 15/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 217 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-07-22 12:52:11,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 178 transitions, 372 flow [2022-07-22 12:52:11,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 174 transitions, 360 flow [2022-07-22 12:52:11,774 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:52:11,788 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 174 transitions, 360 flow [2022-07-22 12:52:11,796 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 174 transitions, 360 flow [2022-07-22 12:52:11,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 174 transitions, 360 flow [2022-07-22 12:52:11,858 INFO L129 PetriNetUnfolder]: 15/174 cut-off events. [2022-07-22 12:52:11,858 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:52:11,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 15/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 221 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-07-22 12:52:11,866 INFO L116 LiptonReduction]: Number of co-enabled transitions 2960 [2022-07-22 12:52:17,583 INFO L131 LiptonReduction]: Checked pairs total: 2835 [2022-07-22 12:52:17,583 INFO L133 LiptonReduction]: Total number of compositions: 207 [2022-07-22 12:52:17,607 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:52:17,607 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:52:17,607 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:52:17,607 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:52:17,607 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:52:17,607 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:52:17,608 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:52:17,608 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:52:17,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:52:17,648 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:52:17,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:17,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:17,654 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:52:17,655 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:17,655 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:52:17,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 34 states, but on-demand construction may add more states [2022-07-22 12:52:17,660 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2022-07-22 12:52:17,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:17,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:17,661 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:52:17,661 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:17,667 INFO L748 eck$LassoCheckResult]: Stem: 171#[ULTIMATE.startENTRY]don't care [698] ULTIMATE.startENTRY-->L101-6: Formula: (let ((.cse1 (store |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse2 (select |v_#memory_int_In_11| 1))) (and (= (select |v_#length_In_13| 1) 2) (= |v_#valid_Out_10| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1)) (= (select |v_#valid_In_13| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~x1~0_Out_6 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= (select .cse2 1) 0) (= v_~size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< 0 |v_#StackHeapBarrier_In_3|) (= (select |v_#valid_In_13| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~f~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= v_~x2~0_Out_18 0) (not (= (ite (< 0 v_~size~0_Out_2) 1 0) 0)) (= v_~f~0.base_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_13| 2) 1) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#length_In_13| 2) 20) (= (select .cse2 0) 48) (= (select |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|)))) InVars {#memory_int=|v_#memory_int_In_11|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_13|, #valid=|v_#valid_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~f~0.base=v_~f~0.base_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~x1~0=v_~x1~0_Out_6, ~f~0.offset=v_~f~0.offset_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ~x2~0=v_~x2~0_Out_18, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_Out_6|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ~size~0=v_~size~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_Out_6|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ~f~0.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, ~f~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ~x2~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 174#[L101-6]don't care [2022-07-22 12:52:17,667 INFO L750 eck$LassoCheckResult]: Loop: 174#[L101-6]don't care [633] L101-6-->L101-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23|))) (and (= 1 (select |v_#valid_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|)) (= (store |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23| (store (select |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_19|)) |v_#memory_int_61|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23| 4) (select |v_#length_80| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 1)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|, #valid=|v_#valid_103|, #memory_int=|v_#memory_int_62|, #length=|v_#length_80|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_19|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_17|, #valid=|v_#valid_103|, #memory_int=|v_#memory_int_61|, #length=|v_#length_80|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~2#1] 174#[L101-6]don't care [2022-07-22 12:52:17,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 729, now seen corresponding path program 1 times [2022-07-22 12:52:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:17,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85338746] [2022-07-22 12:52:17,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:17,826 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:17,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash 664, now seen corresponding path program 1 times [2022-07-22 12:52:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:17,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886966741] [2022-07-22 12:52:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:17,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:17,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash 23232, now seen corresponding path program 1 times [2022-07-22 12:52:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:17,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598525126] [2022-07-22 12:52:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:17,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:17,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:18,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:18,739 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:18,740 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:18,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:18,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:18,740 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:18,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:18,741 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:18,741 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:18,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-2.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:52:18,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:18,741 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:18,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:18,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:18,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:18,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:18,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:18,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:18,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,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 12:52:19,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,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 12:52:19,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:19,520 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:52:19,525 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:52:19,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:19,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:19,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:19,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:19,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:19,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:52:19,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:19,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 12:52:19,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:19,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:19,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:19,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:19,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:19,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:52:19,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:19,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:19,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:19,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:19,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:19,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:19,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:19,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:52:19,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:19,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-22 12:52:19,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:52:19,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:19,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:19,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:19,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:19,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:19,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:19,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:52:19,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:19,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:19,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:19,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:19,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:19,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-22 12:52:19,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:52:19,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:19,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:19,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:19,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:19,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:19,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:19,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:52:19,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:19,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:19,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:19,938 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:19,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:19,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:19,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:19,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:19,983 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:19,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:52:19,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:19,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:19,993 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:52:19,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:19,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,006 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:52:20,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,067 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:52:20,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,136 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:52:20,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,192 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:52:20,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,252 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:52:20,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:52:20,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:52:20,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:52:20,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,320 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:52:20,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:52:20,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,443 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:52:20,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,483 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:52:20,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:52:20,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,553 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:52:20,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:52:20,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:52:20,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:52:20,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:52:20,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:52:20,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:52:20,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:52:20,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:52:20,630 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:52:20,630 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-22 12:52:20,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:52:20,633 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:52:20,640 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:52:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:52:20,682 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:52:20,683 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:52:20,684 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2022-07-22 12:52:20,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:20,785 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:52:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:20,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:52:20,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:20,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:52:20,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:52:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:52:20,960 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:52:20,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 34 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:52:21,016 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 34 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 77 transitions. Complement of second has 3 states. [2022-07-22 12:52:21,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:52:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:52:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:52:21,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:52:21,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:21,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:52:21,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:21,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:52:21,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:52:21,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 77 transitions. [2022-07-22 12:52:21,044 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:21,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 30 states and 66 transitions. [2022-07-22 12:52:21,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-07-22 12:52:21,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 12:52:21,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 66 transitions. [2022-07-22 12:52:21,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:21,056 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:52:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 66 transitions. [2022-07-22 12:52:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 12:52:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:52:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 66 transitions. [2022-07-22 12:52:21,092 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:52:21,092 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 66 transitions. [2022-07-22 12:52:21,094 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:52:21,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 66 transitions. [2022-07-22 12:52:21,099 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:21,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:21,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:21,101 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:52:21,101 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:21,102 INFO L748 eck$LassoCheckResult]: Stem: 392#[ULTIMATE.startENTRY]don't care [698] ULTIMATE.startENTRY-->L101-6: Formula: (let ((.cse1 (store |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse2 (select |v_#memory_int_In_11| 1))) (and (= (select |v_#length_In_13| 1) 2) (= |v_#valid_Out_10| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1)) (= (select |v_#valid_In_13| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~x1~0_Out_6 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= (select .cse2 1) 0) (= v_~size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< 0 |v_#StackHeapBarrier_In_3|) (= (select |v_#valid_In_13| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~f~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= v_~x2~0_Out_18 0) (not (= (ite (< 0 v_~size~0_Out_2) 1 0) 0)) (= v_~f~0.base_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_13| 2) 1) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#length_In_13| 2) 20) (= (select .cse2 0) 48) (= (select |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|)))) InVars {#memory_int=|v_#memory_int_In_11|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_13|, #valid=|v_#valid_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~f~0.base=v_~f~0.base_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~x1~0=v_~x1~0_Out_6, ~f~0.offset=v_~f~0.offset_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ~x2~0=v_~x2~0_Out_18, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_Out_6|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ~size~0=v_~size~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_Out_6|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ~f~0.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, ~f~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ~x2~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 394#[L101-6]don't care [663] L101-6-->L85-3: Formula: (and (= (select |v_#valid_151| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= |v_#memory_int_95| (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_23|))) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_122| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~f~0.base_55) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|)) (= v_~f~0.offset_55 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|) (= |v_ULTIMATE.start_main_#t~pre12#1_23| |v_#pthreadsForks_34|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_151|, #memory_int=|v_#memory_int_96|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~f~0.base=v_~f~0.base_55, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~f~0.offset=v_~f~0.offset_55, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_25|, #valid=|v_#valid_151|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_25|, #memory_int=|v_#memory_int_95|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~f~0.base, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~f~0.offset] 376#[L85-3]don't care [489] L85-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 378#[thread1ENTRY, L85-4]don't care [414] thread1ENTRY-->L49-2: 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] 412#[L85-4, L49-2]don't care [2022-07-22 12:52:21,105 INFO L750 eck$LassoCheckResult]: Loop: 412#[L85-4, L49-2]don't care [687] L49-2-->L49-2: Formula: (let ((.cse1 (* v_~x1~0_In_1 4))) (let ((.cse0 (+ v_~f~0.offset_In_5 .cse1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0)) (<= 0 .cse0) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) .cse0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select |v_#valid_In_7| v_~f~0.base_In_5) 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (<= (+ v_~f~0.offset_In_5 .cse1 4) (select |v_#length_In_7| v_~f~0.base_In_5)) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 4294967296) (mod v_~n~0_In_9 4294967296))))) InVars {~size~0=v_~size~0_In_5, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, ~f~0.base=v_~f~0.base_In_5, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_5, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 412#[L85-4, L49-2]don't care [2022-07-22 12:52:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash 22370355, now seen corresponding path program 1 times [2022-07-22 12:52:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:21,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051800517] [2022-07-22 12:52:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:52:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:52:21,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:52:21,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051800517] [2022-07-22 12:52:21,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051800517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:52:21,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:52:21,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:52:21,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136667181] [2022-07-22 12:52:21,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:52:21,237 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:52:21,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash 718, now seen corresponding path program 1 times [2022-07-22 12:52:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:21,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743689702] [2022-07-22 12:52:21,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:21,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:52:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:52:21,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:52:21,392 INFO L87 Difference]: Start difference. First operand 30 states and 66 transitions. cyclomatic complexity: 51 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:52:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:52:21,433 INFO L93 Difference]: Finished difference Result 30 states and 65 transitions. [2022-07-22 12:52:21,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 65 transitions. [2022-07-22 12:52:21,435 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:21,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 65 transitions. [2022-07-22 12:52:21,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-07-22 12:52:21,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-07-22 12:52:21,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 65 transitions. [2022-07-22 12:52:21,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:52:21,437 INFO L220 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:52:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 65 transitions. [2022-07-22 12:52:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 12:52:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:52:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 65 transitions. [2022-07-22 12:52:21,442 INFO L242 hiAutomatonCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:52:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:52:21,443 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 65 transitions. [2022-07-22 12:52:21,444 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:52:21,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 65 transitions. [2022-07-22 12:52:21,445 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2022-07-22 12:52:21,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:52:21,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:52:21,445 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:52:21,446 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:52:21,446 INFO L748 eck$LassoCheckResult]: Stem: 488#[ULTIMATE.startENTRY]don't care [698] ULTIMATE.startENTRY-->L101-6: Formula: (let ((.cse1 (store |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 1)) (.cse2 (select |v_#memory_int_In_11| 1))) (and (= (select |v_#length_In_13| 1) 2) (= |v_#valid_Out_10| (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1)) (= (select |v_#valid_In_13| 0) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6| 0) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| 4294967296) 1073741823) 1 0)) (= |v_#length_Out_6| (store (store (store |v_#length_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|))) (= v_~x1~0_Out_6 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= |v_#NULL.offset_Out_2| 0) (= (select .cse2 1) 0) (= v_~size~0_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (< 0 |v_#StackHeapBarrier_In_3|) (= (select |v_#valid_In_13| 1) 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= v_~f~0.offset_Out_2 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6| 0) (= v_~x2~0_Out_18 0) (not (= (ite (< 0 v_~size~0_Out_2) 1 0) 0)) (= v_~f~0.base_Out_2 0) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= (select |v_#valid_In_13| 2) 1) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#length_In_13| 2) 20) (= (select .cse2 0) 48) (= (select |v_#valid_In_13| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|)))) InVars {#memory_int=|v_#memory_int_In_11|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_13|, #valid=|v_#valid_In_13|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_Out_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_Out_6|, ~f~0.base=v_~f~0.base_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_6|, ~x1~0=v_~x1~0_Out_6, ~f~0.offset=v_~f~0.offset_Out_2, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_Out_6|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_Out_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_Out_6|, ~x2~0=v_~x2~0_Out_18, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_Out_6|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ~size~0=v_~size~0_Out_2, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_6|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_6|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_6|, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_Out_2|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_Out_2|, #valid=|v_#valid_Out_10|, #memory_int=|v_#memory_int_In_11|, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset_Out_6|, ~n~0=v_~n~0_Out_2, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_Out_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ~f~0.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, ~f~0.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~ret11#1.base, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_create_fresh_int_array_~i~2#1, ~x2~0, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ~size~0, ULTIMATE.start_create_fresh_int_array_#t~post19#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~ret11#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ~n~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 490#[L101-6]don't care [633] L101-6-->L101-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23|))) (and (= 1 (select |v_#valid_103| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|)) (= (store |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23| (store (select |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_19|)) |v_#memory_int_61|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23| 4) (select |v_#length_80| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33| 1)) (<= 0 .cse0)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|, #valid=|v_#valid_103|, #memory_int=|v_#memory_int_62|, #length=|v_#length_80|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_19|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_23|, ULTIMATE.start_create_fresh_int_array_#t~post19#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post19#1_17|, #valid=|v_#valid_103|, #memory_int=|v_#memory_int_61|, #length=|v_#length_80|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_32|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post19#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~2#1] 510#[L101-6]don't care [663] L101-6-->L85-3: Formula: (and (= (select |v_#valid_151| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= |v_#memory_int_95| (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_23|))) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_122| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~f~0.base_55) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_46|)) (= v_~f~0.offset_55 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|) (= |v_ULTIMATE.start_main_#t~pre12#1_23| |v_#pthreadsForks_34|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, #valid=|v_#valid_151|, #memory_int=|v_#memory_int_96|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~f~0.base=v_~f~0.base_55, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~f~0.offset=v_~f~0.offset_55, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_46|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_23|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, #pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_#t~ret11#1.offset=|v_ULTIMATE.start_main_#t~ret11#1.offset_25|, #valid=|v_#valid_151|, ULTIMATE.start_main_#t~ret11#1.base=|v_ULTIMATE.start_main_#t~ret11#1.base_25|, #memory_int=|v_#memory_int_95|, #length=|v_#length_122|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ~f~0.base, ULTIMATE.start_main_#t~ret11#1.offset, ULTIMATE.start_main_#t~ret11#1.base, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~f~0.offset] 472#[L85-3]don't care [489] L85-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_8|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_12|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 474#[thread1ENTRY, L85-4]don't care [414] thread1ENTRY-->L49-2: 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] 508#[L85-4, L49-2]don't care [2022-07-22 12:52:21,447 INFO L750 eck$LassoCheckResult]: Loop: 508#[L85-4, L49-2]don't care [687] L49-2-->L49-2: Formula: (let ((.cse1 (* v_~x1~0_In_1 4))) (let ((.cse0 (+ v_~f~0.offset_In_5 .cse1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| (ite (and (<= 0 v_~x1~0_In_1) (< v_~x1~0_In_1 v_~size~0_In_5)) 1 0)) (<= 0 .cse0) (= (+ |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 1) |v_thread1Thread1of1ForFork1_~i~0#1_Out_2|) (= v_~x1~0_Out_2 (select (select |v_#memory_int_In_5| v_~f~0.base_In_5) .cse0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|) (= (select |v_#valid_In_7| v_~f~0.base_In_5) 1) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2| 0)) (<= (+ v_~f~0.offset_In_5 .cse1 4) (select |v_#length_In_7| v_~f~0.base_In_5)) (< (mod |v_thread1Thread1of1ForFork1_~i~0#1_In_3| 4294967296) (mod v_~n~0_In_9 4294967296))))) InVars {~size~0=v_~size~0_In_5, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_In_3|, ~f~0.base=v_~f~0.base_In_5, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, ~n~0=v_~n~0_In_9, ~x1~0=v_~x1~0_In_1, ~f~0.offset=v_~f~0.offset_In_5} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_Out_2|, ~size~0=v_~size~0_In_5, ~f~0.base=v_~f~0.base_In_5, ~x1~0=v_~x1~0_Out_2, ~f~0.offset=v_~f~0.offset_In_5, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_Out_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_2|, #valid=|v_#valid_In_7|, #memory_int=|v_#memory_int_In_5|, #length=|v_#length_In_7|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_Out_2|, ~n~0=v_~n~0_In_9, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~x1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 508#[L85-4, L49-2]don't care [2022-07-22 12:52:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 692757228, now seen corresponding path program 1 times [2022-07-22 12:52:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:21,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981788951] [2022-07-22 12:52:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:21,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 718, now seen corresponding path program 2 times [2022-07-22 12:52:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:21,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870519700] [2022-07-22 12:52:21,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:21,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:52:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash 638275, now seen corresponding path program 1 times [2022-07-22 12:52:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:52:21,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031468839] [2022-07-22 12:52:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:52:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:52:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:52:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:52:21,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:52:21,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:52:22,949 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:52:22,949 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:52:22,949 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:52:22,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:52:22,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:52:22,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:52:22,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:52:22,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:52:22,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-cond-2.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:52:22,950 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:52:22,950 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:52:22,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:22,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:23,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:23,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:23,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:52:23,180 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:52:23,184 INFO L158 Benchmark]: Toolchain (without parser) took 12756.76ms. Allocated memory was 152.0MB in the beginning and 228.6MB in the end (delta: 76.5MB). Free memory was 127.0MB in the beginning and 120.6MB in the end (delta: 6.4MB). Peak memory consumption was 107.8MB. Max. memory is 8.0GB. [2022-07-22 12:52:23,184 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 152.0MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:52:23,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.29ms. Allocated memory is still 152.0MB. Free memory was 127.0MB in the beginning and 116.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:52:23,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.43ms. Allocated memory is still 152.0MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:52:23,186 INFO L158 Benchmark]: Boogie Preprocessor took 66.60ms. Allocated memory is still 152.0MB. Free memory was 114.1MB in the beginning and 112.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:52:23,187 INFO L158 Benchmark]: RCFGBuilder took 519.29ms. Allocated memory is still 152.0MB. Free memory was 112.7MB in the beginning and 97.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-07-22 12:52:23,188 INFO L158 Benchmark]: BuchiAutomizer took 11774.97ms. Allocated memory was 152.0MB in the beginning and 228.6MB in the end (delta: 76.5MB). Free memory was 96.6MB in the beginning and 120.6MB in the end (delta: -24.0MB). Peak memory consumption was 77.4MB. Max. memory is 8.0GB. [2022-07-22 12:52:23,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 152.0MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 334.29ms. Allocated memory is still 152.0MB. Free memory was 127.0MB in the beginning and 116.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.43ms. Allocated memory is still 152.0MB. Free memory was 116.2MB in the beginning and 114.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.60ms. Allocated memory is still 152.0MB. Free memory was 114.1MB in the beginning and 112.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 519.29ms. Allocated memory is still 152.0MB. Free memory was 112.7MB in the beginning and 97.0MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 11774.97ms. Allocated memory was 152.0MB in the beginning and 228.6MB in the end (delta: 76.5MB). Free memory was 96.6MB in the beginning and 120.6MB in the end (delta: -24.0MB). Peak memory consumption was 77.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 166 PlacesBefore, 21 PlacesAfterwards, 174 TransitionsBefore, 17 TransitionsAfterwards, 2960 CoEnabledTransitionPairs, 7 FixpointIterations, 85 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 20 TrivialYvCompositions, 29 ConcurrentYvCompositions, 12 ChoiceCompositions, 207 TotalNumberOfCompositions, 2835 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2753, positive: 2744, positive conditional: 0, positive unconditional: 2744, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1731, positive: 1725, positive conditional: 0, positive unconditional: 1725, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2753, positive: 1019, positive conditional: 0, positive unconditional: 1019, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1731, unknown conditional: 0, unknown unconditional: 1731] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:52:23,212 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...