/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:22:44,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:22:44,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:22:45,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:22:45,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:22:45,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:22:45,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:22:45,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:22:45,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:22:45,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:22:45,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:22:45,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:22:45,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:22:45,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:22:45,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:22:45,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:22:45,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:22:45,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:22:45,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:22:45,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:22:45,103 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:22:45,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:22:45,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:22:45,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:22:45,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:22:45,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:22:45,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:22:45,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:22:45,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:22:45,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:22:45,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:22:45,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:22:45,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:22:45,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:22:45,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:22:45,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:22:45,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:22:45,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:22:45,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:22:45,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:22:45,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:22:45,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:22:45,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:22:45,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:22:45,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:22:45,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:22:45,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:22:45,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:22:45,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:22:45,158 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:22:45,158 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:22:45,158 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:22:45,158 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:22:45,158 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:22:45,159 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:22:45,159 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:22:45,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:22:45,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:22:45,159 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:22:45,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:22:45,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:22:45,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:22:45,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:22:45,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:22:45,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:22:45,161 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:22:45,161 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:22:45,161 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:22:45,161 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:22:45,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:22:45,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:22:45,162 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:22:45,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:22:45,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:22:45,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:22:45,164 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:22:45,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:22:45,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:22:45,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:22:45,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:22:45,571 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:22:45,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-07-22 12:22:45,671 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470afd43f/3c5b56243a9040f987bf0854c3186532/FLAG80bef55e8 [2022-07-22 12:22:46,360 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:22:46,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2022-07-22 12:22:46,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470afd43f/3c5b56243a9040f987bf0854c3186532/FLAG80bef55e8 [2022-07-22 12:22:46,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/470afd43f/3c5b56243a9040f987bf0854c3186532 [2022-07-22 12:22:46,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:22:46,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:22:46,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:22:46,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:22:46,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:22:46,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:22:46" (1/1) ... [2022-07-22 12:22:46,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41cc2af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:46, skipping insertion in model container [2022-07-22 12:22:46,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:22:46" (1/1) ... [2022-07-22 12:22:46,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:22:46,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:22:46,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2599,2612] [2022-07-22 12:22:46,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:22:46,957 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:22:46,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2599,2612] [2022-07-22 12:22:46,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:22:47,008 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:22:47,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47 WrapperNode [2022-07-22 12:22:47,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:22:47,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:22:47,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:22:47,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:22:47,019 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:22:47" (1/1) ... [2022-07-22 12:22:47,031 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:22:47" (1/1) ... [2022-07-22 12:22:47,071 INFO L137 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 261 [2022-07-22 12:22:47,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:22:47,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:22:47,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:22:47,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:22:47,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:22:47,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:22:47,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:22:47,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:22:47,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (1/1) ... [2022-07-22 12:22:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:47,177 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:22:47,187 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:22:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:22:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:22:47,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:22:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:22:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:22:47,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:22:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:22:47,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:22:47,241 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:22:47,241 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:22:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:22:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:22:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:22:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:22:47,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:22:47,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:22:47,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:22:47,245 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:22:47,360 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:22:47,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:22:47,846 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:22:48,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:22:48,187 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 12:22:48,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:22:48 BoogieIcfgContainer [2022-07-22 12:22:48,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:22:48,192 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:22:48,192 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:22:48,196 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:22:48,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:22:48,198 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:22:46" (1/3) ... [2022-07-22 12:22:48,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56f503fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:22:48, skipping insertion in model container [2022-07-22 12:22:48,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:22:48,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:47" (2/3) ... [2022-07-22 12:22:48,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56f503fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:22:48, skipping insertion in model container [2022-07-22 12:22:48,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:22:48,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:22:48" (3/3) ... [2022-07-22 12:22:48,201 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2022-07-22 12:22:48,308 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:22:48,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 191 transitions, 406 flow [2022-07-22 12:22:48,494 INFO L129 PetriNetUnfolder]: 16/185 cut-off events. [2022-07-22 12:22:48,495 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:22:48,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 16/185 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 148. Up to 2 conditions per place. [2022-07-22 12:22:48,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 191 transitions, 406 flow [2022-07-22 12:22:48,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 185 transitions, 388 flow [2022-07-22 12:22:48,528 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:22:48,550 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 185 transitions, 388 flow [2022-07-22 12:22:48,553 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 185 transitions, 388 flow [2022-07-22 12:22:48,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 185 transitions, 388 flow [2022-07-22 12:22:48,596 INFO L129 PetriNetUnfolder]: 16/185 cut-off events. [2022-07-22 12:22:48,596 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:22:48,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 16/185 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 103 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 148. Up to 2 conditions per place. [2022-07-22 12:22:48,600 INFO L116 LiptonReduction]: Number of co-enabled transitions 1320 [2022-07-22 12:22:56,471 INFO L131 LiptonReduction]: Checked pairs total: 1431 [2022-07-22 12:22:56,472 INFO L133 LiptonReduction]: Total number of compositions: 190 [2022-07-22 12:22:56,496 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:22:56,496 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:22:56,496 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:22:56,496 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:22:56,497 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:22:56,497 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:22:56,497 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:22:56,497 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:22:56,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:22:56,581 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 64 [2022-07-22 12:22:56,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:56,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:56,588 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:22:56,588 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:22:56,588 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:22:56,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 107 states, but on-demand construction may add more states [2022-07-22 12:22:56,599 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 64 [2022-07-22 12:22:56,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:56,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:56,600 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:22:56,600 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:22:56,606 INFO L748 eck$LassoCheckResult]: Stem: 185#[ULTIMATE.startENTRY]don't care [1064] ULTIMATE.startENTRY-->L107-6: Formula: (let ((.cse1 (store |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67| 1)) (.cse0 (select |v_#memory_int_200| 1))) (and (= (select .cse0 0) 48) (= v_~res1~0_97 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_#NULL.base_12| 0) (= v_~B~0.offset_112 0) (= (store (store (store (store |v_#length_253| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_67| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4)) |v_#length_251|) (= |v_#valid_306| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_59|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) 1 0) 0)) (= v_~A~0.offset_100 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= (select .cse0 1) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67|) 0) (= v_~B~0.base_112 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (< 0 |v_#StackHeapBarrier_59|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_49| 0) (= (select |v_#valid_308| 0) 0) (= v_~res2~0_123 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t3~0#1.base_67|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~N~0_90) (= v_~A~0.base_100 0) (= 29 (select |v_#length_253| 2)) (= (select |v_#valid_308| 1) 1) (= (select |v_#valid_308| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= (select |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#length_253| 1) 2) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_59|, #valid=|v_#valid_308|, #memory_int=|v_#memory_int_200|, #length=|v_#length_253|} OutVars{~res1~0=v_~res1~0_97, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_24|, ~A~0.base=v_~A~0.base_100, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret18#1.base=|v_ULTIMATE.start_main_#t~ret18#1.base_35|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_53|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_39|, #length=|v_#length_251|, ~B~0.offset=v_~B~0.offset_112, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_107|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_30|, #StackHeapBarrier=|v_#StackHeapBarrier_59|, ~M~0=v_~M~0_57, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ~B~0.base=v_~B~0.base_112, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_19|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_34|, ~res2~0=v_~res2~0_123, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_53|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_23|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_41|, ~N~0=v_~N~0_90, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_12|, ~A~0.offset=v_~A~0.offset_100, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_53|, #valid=|v_#valid_306|, #memory_int=|v_#memory_int_200|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_39|, ULTIMATE.start_main_#t~ret18#1.offset=|v_ULTIMATE.start_main_#t~ret18#1.offset_35|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ~B~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~ret18#1.base, ULTIMATE.start_main_#t~ret19#1.offset, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_main_#t~nondet17#1, ~B~0.offset, ~res2~0, ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre24#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#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~nondet16#1, ~A~0.offset, ~M~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~ret18#1.offset, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 188#[L107-6]don't care [2022-07-22 12:22:56,606 INFO L750 eck$LassoCheckResult]: Loop: 188#[L107-6]don't care [1024] L107-6-->L107-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (<= 0 .cse0) (= (store |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|)) |v_#memory_int_146|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|)) (= 1 (select |v_#valid_220| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_147|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_39|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_146|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 188#[L107-6]don't care [2022-07-22 12:22:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1095, now seen corresponding path program 1 times [2022-07-22 12:22:56,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:56,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094687935] [2022-07-22 12:22:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:56,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:56,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1055, now seen corresponding path program 1 times [2022-07-22 12:22:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:56,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060930672] [2022-07-22 12:22:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:56,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:56,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash 34969, now seen corresponding path program 1 times [2022-07-22 12:22:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:56,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716869784] [2022-07-22 12:22:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:56,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:56,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:57,976 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:22:57,977 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:22:57,977 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:22:57,977 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:22:57,977 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:22:57,977 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:57,977 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:22:57,977 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:22:57,978 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-array-sum2.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:22:57,978 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:22:57,978 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:22:58,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:58,976 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:22:58,981 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:22:58,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:58,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:58,984 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:22:58,985 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:22:58,986 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:22:58,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:58,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:58,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:58,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:58,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:58,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:58,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:22:59,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,036 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:22:59,042 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:22:59,042 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:22:59,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,109 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:22:59,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,115 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:22:59,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:22:59,124 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:22:59,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:22:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,162 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:22:59,163 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:22:59,166 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:22:59,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,206 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:22:59,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,207 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:22:59,208 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:22:59,209 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:22:59,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:22:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,278 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:22:59,283 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:22:59,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,294 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:22:59,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,343 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:22:59,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,345 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:22:59,351 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:22:59,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,366 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:22:59,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,417 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:22:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,419 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:22:59,424 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:22:59,426 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:22:59,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,489 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:22:59,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,490 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:22:59,493 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:22:59,493 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:22:59,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,543 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:22:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,545 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:22:59,546 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:22:59,550 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:22:59,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,606 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:22:59,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,608 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:22:59,609 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:22:59,610 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:22:59,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,617 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,618 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,618 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 12:22:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,643 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:22:59,644 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:22:59,645 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:22:59,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,658 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,685 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:22:59,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,686 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:22:59,687 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:22:59,688 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:22:59,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,751 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:22:59,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,753 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:22:59,758 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:22:59,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,774 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:22:59,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,820 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:22:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,821 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:22:59,826 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:22:59,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:59,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:59,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:59,838 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:22:59,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,886 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:22:59,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,888 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:22:59,897 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:22:59,904 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:22:59,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:59,938 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:22:59,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:59,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:59,940 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:22:59,943 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:22:59,946 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:22:59,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:59,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:59,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:59,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:59,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:59,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:59,980 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,019 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:23:00,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,031 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:23:00,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,060 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:23:00,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,062 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:23:00,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:00,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:00,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:00,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:00,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,120 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:23:00,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,161 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:23:00,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:00,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,211 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:23:00,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,222 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:23:00,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,230 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:23:00,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,237 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 12:23:00,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,261 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:23:00,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:23:00,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,300 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:23:00,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-22 12:23:00,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,338 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:23:00,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:00,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,375 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:23:00,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 12:23:00,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,441 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:23:00,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:23:00,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,489 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:23:00,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:23:00,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,532 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:23:00,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:23:00,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:23:00,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:23:00,546 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:00,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,572 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:23:00,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:23:00,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,611 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:23:00,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:23:00,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,650 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:23:00,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:23:00,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:23:00,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:23:00,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:23:00,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:23:00,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:23:00,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:23:00,685 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:23:00,724 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:23:00,724 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-22 12:23:00,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:00,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:00,734 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:23:00,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:23:00,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:23:00,799 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 12:23:00,799 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:23:00,800 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~3#1) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 2*ULTIMATE.start_create_fresh_int_array_~i~3#1 Supporting invariants [-2*ULTIMATE.start_create_fresh_int_array_~size#1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 >= 0] [2022-07-22 12:23:00,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:01,008 INFO L257 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2022-07-22 12:23:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:01,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:23:01,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:01,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:23:01,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:23:01,139 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:23:01,142 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 107 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:01,216 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 107 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 110 states and 333 transitions. Complement of second has 3 states. [2022-07-22 12:23:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:23:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:23:01,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:23:01,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:01,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:23:01,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:01,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:23:01,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:23:01,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 110 states and 333 transitions. [2022-07-22 12:23:01,235 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:23:01,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 110 states to 102 states and 314 transitions. [2022-07-22 12:23:01,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2022-07-22 12:23:01,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2022-07-22 12:23:01,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 314 transitions. [2022-07-22 12:23:01,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:01,248 INFO L220 hiAutomatonCegarLoop]: Abstraction has 102 states and 314 transitions. [2022-07-22 12:23:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 314 transitions. [2022-07-22 12:23:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-07-22 12:23:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 3.089108910891089) internal successors, (312), 100 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 312 transitions. [2022-07-22 12:23:01,291 INFO L242 hiAutomatonCegarLoop]: Abstraction has 101 states and 312 transitions. [2022-07-22 12:23:01,291 INFO L425 stractBuchiCegarLoop]: Abstraction has 101 states and 312 transitions. [2022-07-22 12:23:01,292 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:23:01,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 312 transitions. [2022-07-22 12:23:01,294 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:23:01,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:01,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:01,295 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 12:23:01,295 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:01,296 INFO L748 eck$LassoCheckResult]: Stem: 823#[ULTIMATE.startENTRY]don't care [1064] ULTIMATE.startENTRY-->L107-6: Formula: (let ((.cse1 (store |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67| 1)) (.cse0 (select |v_#memory_int_200| 1))) (and (= (select .cse0 0) 48) (= v_~res1~0_97 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_#NULL.base_12| 0) (= v_~B~0.offset_112 0) (= (store (store (store (store |v_#length_253| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_67| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4)) |v_#length_251|) (= |v_#valid_306| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_59|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) 1 0) 0)) (= v_~A~0.offset_100 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= (select .cse0 1) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67|) 0) (= v_~B~0.base_112 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (< 0 |v_#StackHeapBarrier_59|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_49| 0) (= (select |v_#valid_308| 0) 0) (= v_~res2~0_123 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t3~0#1.base_67|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~N~0_90) (= v_~A~0.base_100 0) (= 29 (select |v_#length_253| 2)) (= (select |v_#valid_308| 1) 1) (= (select |v_#valid_308| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= (select |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#length_253| 1) 2) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_59|, #valid=|v_#valid_308|, #memory_int=|v_#memory_int_200|, #length=|v_#length_253|} OutVars{~res1~0=v_~res1~0_97, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_24|, ~A~0.base=v_~A~0.base_100, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret18#1.base=|v_ULTIMATE.start_main_#t~ret18#1.base_35|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_53|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_39|, #length=|v_#length_251|, ~B~0.offset=v_~B~0.offset_112, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_107|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_30|, #StackHeapBarrier=|v_#StackHeapBarrier_59|, ~M~0=v_~M~0_57, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ~B~0.base=v_~B~0.base_112, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_19|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_34|, ~res2~0=v_~res2~0_123, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_53|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_23|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_41|, ~N~0=v_~N~0_90, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_12|, ~A~0.offset=v_~A~0.offset_100, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_53|, #valid=|v_#valid_306|, #memory_int=|v_#memory_int_200|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_39|, ULTIMATE.start_main_#t~ret18#1.offset=|v_ULTIMATE.start_main_#t~ret18#1.offset_35|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ~B~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~ret18#1.base, ULTIMATE.start_main_#t~ret19#1.offset, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_main_#t~nondet17#1, ~B~0.offset, ~res2~0, ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre24#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#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~nondet16#1, ~A~0.offset, ~M~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~ret18#1.offset, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 817#[L107-6]don't care [1058] L107-6-->L107-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_101|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_101| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| v_~N~0_82) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| |v_#StackHeapBarrier_55|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_86| v_~A~0.offset_96) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_86| v_~A~0.base_96) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_157| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_100| |v_ULTIMATE.start_create_fresh_int_array_~size#1_102|)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_101|) 1 0) 0)) (= (store |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| 1) |v_#valid_290|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_157|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99| 0) (= (store |v_#length_240| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_101| 4)) |v_#length_239|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_86|, #StackHeapBarrier=|v_#StackHeapBarrier_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_86|, #valid=|v_#valid_291|, #length=|v_#length_240|, ~N~0=v_~N~0_82, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_100|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ~A~0.base=v_~A~0.base_96, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_49|, ~N~0=v_~N~0_82, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_41|, ULTIMATE.start_main_#t~ret18#1.base=|v_ULTIMATE.start_main_#t~ret18#1.base_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_101|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_67|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_55|, ~A~0.offset=v_~A~0.offset_96, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_157|, #valid=|v_#valid_290|, #length=|v_#length_239|, ULTIMATE.start_main_#t~ret18#1.offset=|v_ULTIMATE.start_main_#t~ret18#1.offset_31|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret18#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_main_#t~ret18#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 821#[L107-14]don't care [2022-07-22 12:23:01,299 INFO L750 eck$LassoCheckResult]: Loop: 821#[L107-14]don't care [1043] L107-14-->L107-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_217| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_262| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| |v_ULTIMATE.start_create_fresh_int_array_~size#1_91|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|)) |v_#memory_int_176|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_177|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_45|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_176|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 821#[L107-14]don't care [2022-07-22 12:23:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash 35003, now seen corresponding path program 1 times [2022-07-22 12:23:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:01,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032871031] [2022-07-22 12:23:01,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:01,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1074, now seen corresponding path program 1 times [2022-07-22 12:23:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:01,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093895754] [2022-07-22 12:23:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:01,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 12:23:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1086136, now seen corresponding path program 1 times [2022-07-22 12:23:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:01,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085573246] [2022-07-22 12:23:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:23:01,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085573246] [2022-07-22 12:23:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085573246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:23:01,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:23:01,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:23:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235946936] [2022-07-22 12:23:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:23:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:01,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:23:01,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:23:01,611 INFO L87 Difference]: Start difference. First operand 101 states and 312 transitions. cyclomatic complexity: 275 Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:01,710 INFO L93 Difference]: Finished difference Result 103 states and 313 transitions. [2022-07-22 12:23:01,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 313 transitions. [2022-07-22 12:23:01,714 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:23:01,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 102 states and 312 transitions. [2022-07-22 12:23:01,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2022-07-22 12:23:01,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2022-07-22 12:23:01,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 312 transitions. [2022-07-22 12:23:01,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:01,720 INFO L220 hiAutomatonCegarLoop]: Abstraction has 102 states and 312 transitions. [2022-07-22 12:23:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 312 transitions. [2022-07-22 12:23:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-22 12:23:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 3.0588235294117645) internal successors, (312), 101 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 312 transitions. [2022-07-22 12:23:01,732 INFO L242 hiAutomatonCegarLoop]: Abstraction has 102 states and 312 transitions. [2022-07-22 12:23:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:23:01,733 INFO L425 stractBuchiCegarLoop]: Abstraction has 102 states and 312 transitions. [2022-07-22 12:23:01,734 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:23:01,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 312 transitions. [2022-07-22 12:23:01,736 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:23:01,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:01,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:01,736 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:23:01,736 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:01,737 INFO L748 eck$LassoCheckResult]: Stem: 1139#[ULTIMATE.startENTRY]don't care [1064] ULTIMATE.startENTRY-->L107-6: Formula: (let ((.cse1 (store |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67| 1)) (.cse0 (select |v_#memory_int_200| 1))) (and (= (select .cse0 0) 48) (= v_~res1~0_97 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_#NULL.base_12| 0) (= v_~B~0.offset_112 0) (= (store (store (store (store |v_#length_253| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_67| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4)) |v_#length_251|) (= |v_#valid_306| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_59|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) 1 0) 0)) (= v_~A~0.offset_100 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= (select .cse0 1) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67|) 0) (= v_~B~0.base_112 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (< 0 |v_#StackHeapBarrier_59|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_49| 0) (= (select |v_#valid_308| 0) 0) (= v_~res2~0_123 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t3~0#1.base_67|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~N~0_90) (= v_~A~0.base_100 0) (= 29 (select |v_#length_253| 2)) (= (select |v_#valid_308| 1) 1) (= (select |v_#valid_308| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= (select |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#length_253| 1) 2) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_59|, #valid=|v_#valid_308|, #memory_int=|v_#memory_int_200|, #length=|v_#length_253|} OutVars{~res1~0=v_~res1~0_97, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_24|, ~A~0.base=v_~A~0.base_100, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret18#1.base=|v_ULTIMATE.start_main_#t~ret18#1.base_35|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_53|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_39|, #length=|v_#length_251|, ~B~0.offset=v_~B~0.offset_112, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_107|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_30|, #StackHeapBarrier=|v_#StackHeapBarrier_59|, ~M~0=v_~M~0_57, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ~B~0.base=v_~B~0.base_112, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_19|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_34|, ~res2~0=v_~res2~0_123, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_53|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_23|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_41|, ~N~0=v_~N~0_90, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_12|, ~A~0.offset=v_~A~0.offset_100, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_53|, #valid=|v_#valid_306|, #memory_int=|v_#memory_int_200|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_39|, ULTIMATE.start_main_#t~ret18#1.offset=|v_ULTIMATE.start_main_#t~ret18#1.offset_35|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ~B~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~ret18#1.base, ULTIMATE.start_main_#t~ret19#1.offset, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_main_#t~nondet17#1, ~B~0.offset, ~res2~0, ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre24#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#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~nondet16#1, ~A~0.offset, ~M~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~ret18#1.offset, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1133#[L107-6]don't care [1024] L107-6-->L107-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (<= 0 .cse0) (= (store |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|)) |v_#memory_int_146|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|)) (= 1 (select |v_#valid_220| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_147|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_39|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_146|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 1135#[L107-6]don't care [1058] L107-6-->L107-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_101|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_101| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| v_~N~0_82) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| |v_#StackHeapBarrier_55|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_86| v_~A~0.offset_96) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_86| v_~A~0.base_96) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_157| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_100| |v_ULTIMATE.start_create_fresh_int_array_~size#1_102|)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_101|) 1 0) 0)) (= (store |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| 1) |v_#valid_290|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_157|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99| 0) (= (store |v_#length_240| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_101| 4)) |v_#length_239|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_86|, #StackHeapBarrier=|v_#StackHeapBarrier_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_86|, #valid=|v_#valid_291|, #length=|v_#length_240|, ~N~0=v_~N~0_82, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_100|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ~A~0.base=v_~A~0.base_96, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_49|, ~N~0=v_~N~0_82, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_41|, ULTIMATE.start_main_#t~ret18#1.base=|v_ULTIMATE.start_main_#t~ret18#1.base_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_101|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_67|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_55|, ~A~0.offset=v_~A~0.offset_96, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_157|, #valid=|v_#valid_290|, #length=|v_#length_239|, ULTIMATE.start_main_#t~ret18#1.offset=|v_ULTIMATE.start_main_#t~ret18#1.offset_31|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret18#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_main_#t~ret18#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1137#[L107-14]don't care [1043] L107-14-->L107-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_217| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_262| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| |v_ULTIMATE.start_create_fresh_int_array_~size#1_91|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|)) |v_#memory_int_176|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_177|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_45|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_176|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 1141#[L107-14]don't care [2022-07-22 12:23:01,738 INFO L750 eck$LassoCheckResult]: Loop: 1141#[L107-14]don't care [1043] L107-14-->L107-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_217| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_262| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| |v_ULTIMATE.start_create_fresh_int_array_~size#1_91|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|)) |v_#memory_int_176|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_177|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_45|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_176|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 1141#[L107-14]don't care [2022-07-22 12:23:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash 33639050, now seen corresponding path program 1 times [2022-07-22 12:23:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:01,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171731132] [2022-07-22 12:23:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:01,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:01,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1074, now seen corresponding path program 2 times [2022-07-22 12:23:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:01,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127547225] [2022-07-22 12:23:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:01,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:01,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:01,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1042811593, now seen corresponding path program 2 times [2022-07-22 12:23:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:01,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17176108] [2022-07-22 12:23:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:23:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:23:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:23:01,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17176108] [2022-07-22 12:23:01,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17176108] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:23:01,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015641824] [2022-07-22 12:23:01,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 12:23:01,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:23:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:23:01,946 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:23:01,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-22 12:23:02,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 12:23:02,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 12:23:02,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 12:23:02,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:23:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:23:02,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:23:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:23:02,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015641824] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:23:02,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:23:02,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-07-22 12:23:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934969183] [2022-07-22 12:23:02,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:23:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:23:02,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 12:23:02,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-22 12:23:02,200 INFO L87 Difference]: Start difference. First operand 102 states and 312 transitions. cyclomatic complexity: 274 Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:23:02,409 INFO L93 Difference]: Finished difference Result 203 states and 623 transitions. [2022-07-22 12:23:02,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 623 transitions. [2022-07-22 12:23:02,413 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 125 [2022-07-22 12:23:02,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 203 states and 623 transitions. [2022-07-22 12:23:02,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2022-07-22 12:23:02,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 201 [2022-07-22 12:23:02,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 623 transitions. [2022-07-22 12:23:02,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:23:02,421 INFO L220 hiAutomatonCegarLoop]: Abstraction has 203 states and 623 transitions. [2022-07-22 12:23:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 623 transitions. [2022-07-22 12:23:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 105. [2022-07-22 12:23:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 3.0095238095238095) internal successors, (316), 104 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:23:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 316 transitions. [2022-07-22 12:23:02,432 INFO L242 hiAutomatonCegarLoop]: Abstraction has 105 states and 316 transitions. [2022-07-22 12:23:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:23:02,434 INFO L425 stractBuchiCegarLoop]: Abstraction has 105 states and 316 transitions. [2022-07-22 12:23:02,434 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:23:02,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 316 transitions. [2022-07-22 12:23:02,435 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:23:02,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:23:02,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:23:02,436 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2022-07-22 12:23:02,436 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:23:02,437 INFO L748 eck$LassoCheckResult]: Stem: 1594#[ULTIMATE.startENTRY]don't care [1064] ULTIMATE.startENTRY-->L107-6: Formula: (let ((.cse1 (store |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 1))) (let ((.cse3 (store .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67| 1)) (.cse0 (select |v_#memory_int_200| 1))) (and (= (select .cse0 0) 48) (= v_~res1~0_97 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) (= (select .cse1 |v_ULTIMATE.start_main_~#t2~0#1.base_59|) 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t2~0#1.base_59|) (= (select .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|) 0) (= |v_#NULL.base_12| 0) (= v_~B~0.offset_112 0) (= (store (store (store (store |v_#length_253| |v_ULTIMATE.start_main_~#t1~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_59| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_67| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4)) |v_#length_251|) (= |v_#valid_306| (store .cse2 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| |v_#StackHeapBarrier_59|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_107|) 1 0) 0)) (= v_~A~0.offset_100 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_107| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|) (= (select .cse0 1) 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_67|) 0) (= v_~B~0.base_112 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_57| 0) (< 0 |v_#StackHeapBarrier_59|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_53| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_49| 0) (= (select |v_#valid_308| 0) 0) (= v_~res2~0_123 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t3~0#1.base_67|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31| v_~N~0_90) (= v_~A~0.base_100 0) (= 29 (select |v_#length_253| 2)) (= (select |v_#valid_308| 1) 1) (= (select |v_#valid_308| 2) 1) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91| 0) (= (select |v_#valid_308| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) 0) (= |v_#NULL.offset_12| 0) (= (select |v_#length_253| 1) 2) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105| 0) (< |v_#StackHeapBarrier_59| |v_ULTIMATE.start_main_~#t1~0#1.base_59|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_163| 0)) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91| 0)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_59|, #valid=|v_#valid_308|, #memory_int=|v_#memory_int_200|, #length=|v_#length_253|} OutVars{~res1~0=v_~res1~0_97, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_91|, ULTIMATE.start_main_#t~mem26#1=|v_ULTIMATE.start_main_#t~mem26#1_24|, ~A~0.base=v_~A~0.base_100, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_49|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_#t~ret18#1.base=|v_ULTIMATE.start_main_#t~ret18#1.base_35|, ULTIMATE.start_main_#t~ret19#1.offset=|v_ULTIMATE.start_main_#t~ret19#1.offset_53|, ULTIMATE.start_main_#t~mem27#1=|v_ULTIMATE.start_main_#t~mem27#1_22|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_71|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_39|, #length=|v_#length_251|, ~B~0.offset=v_~B~0.offset_112, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_51|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_107|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_47|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_30|, #StackHeapBarrier=|v_#StackHeapBarrier_59|, ~M~0=v_~M~0_57, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_71|, ~B~0.base=v_~B~0.base_112, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_57|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_19|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_47|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_163|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_34|, ~res2~0=v_~res2~0_123, ULTIMATE.start_main_#t~ret19#1.base=|v_ULTIMATE.start_main_#t~ret19#1.base_53|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_23|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_42|, ULTIMATE.start_main_#t~pre24#1=|v_ULTIMATE.start_main_#t~pre24#1_41|, ~N~0=v_~N~0_90, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_105|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_59|, #NULL.base=|v_#NULL.base_12|, ~A~0.offset=v_~A~0.offset_100, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_53|, #valid=|v_#valid_306|, #memory_int=|v_#memory_int_200|, ULTIMATE.start_main_#t~pre22#1=|v_ULTIMATE.start_main_#t~pre22#1_39|, ULTIMATE.start_main_#t~ret18#1.offset=|v_ULTIMATE.start_main_#t~ret18#1.offset_35|, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_59|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_133|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~mem26#1, ~A~0.base, ~B~0.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~ret18#1.base, ULTIMATE.start_main_#t~ret19#1.offset, ULTIMATE.start_main_#t~mem27#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #length, ULTIMATE.start_main_#t~nondet17#1, ~B~0.offset, ~res2~0, ULTIMATE.start_main_#t~ret19#1.base, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre24#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#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~nondet16#1, ~A~0.offset, ~M~0, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #valid, ULTIMATE.start_main_#t~pre22#1, ULTIMATE.start_main_#t~ret18#1.offset, ULTIMATE.start_main_#t~mem28#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1586#[L107-6]don't care [1024] L107-6-->L107-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (<= 0 .cse0) (= (store |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|)) |v_#memory_int_146|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|)) (= 1 (select |v_#valid_220| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_147|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_39|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_146|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 1588#[L107-6]don't care [1024] L107-6-->L107-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|))) (and (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| |v_ULTIMATE.start_create_fresh_int_array_~size#1_73|) (<= 0 .cse0) (= (store |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59| (store (select |v_#memory_int_147| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|)) |v_#memory_int_146|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70| 1)) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59| 4) (select |v_#length_179| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|)) (= 1 (select |v_#valid_220| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_38|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_147|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_70|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_59|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_39|, #valid=|v_#valid_220|, #memory_int=|v_#memory_int_146|, #length=|v_#length_179|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_69|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 1590#[L107-6]don't care [1058] L107-6-->L107-14: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_101|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_101| 4294967296) 1073741823) 1 0)) (= (select |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27| v_~N~0_82) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| |v_#StackHeapBarrier_55|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_86| v_~A~0.offset_96) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_86| v_~A~0.base_96) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_157| 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_100| |v_ULTIMATE.start_create_fresh_int_array_~size#1_102|)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_101|) 1 0) 0)) (= (store |v_#valid_291| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| 1) |v_#valid_290|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_157|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99| 0) (= (store |v_#length_240| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85| (* |v_ULTIMATE.start_create_fresh_int_array_~size#1_101| 4)) |v_#length_239|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_86|, #StackHeapBarrier=|v_#StackHeapBarrier_55|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_86|, #valid=|v_#valid_291|, #length=|v_#length_240|, ~N~0=v_~N~0_82, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_100|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_102|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_85|, ~A~0.base=v_~A~0.base_96, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_85|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_49|, ~N~0=v_~N~0_82, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_99|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_41|, ULTIMATE.start_main_#t~ret18#1.base=|v_ULTIMATE.start_main_#t~ret18#1.base_31|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_101|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset_67|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_41|, #StackHeapBarrier=|v_#StackHeapBarrier_55|, ~A~0.offset=v_~A~0.offset_96, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_27|, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base_67|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_157|, #valid=|v_#valid_290|, #length=|v_#length_239|, ULTIMATE.start_main_#t~ret18#1.offset=|v_ULTIMATE.start_main_#t~ret18#1.offset_31|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_127|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret18#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #length, ULTIMATE.start_main_#t~ret18#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1596#[L107-14]don't care [1043] L107-14-->L107-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_217| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_262| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| |v_ULTIMATE.start_create_fresh_int_array_~size#1_91|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|)) |v_#memory_int_176|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_177|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_45|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_176|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 1598#[L107-14]don't care [2022-07-22 12:23:02,437 INFO L750 eck$LassoCheckResult]: Loop: 1598#[L107-14]don't care [1043] L107-14-->L107-14: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|))) (and (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|) (<= 0 .cse0) (<= (+ .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73| 4) (select |v_#length_217| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|)) (= (select |v_#valid_262| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86| |v_ULTIMATE.start_create_fresh_int_array_~size#1_91|) (= (store |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73| (store (select |v_#memory_int_177| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|)) |v_#memory_int_176|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_46|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_177|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_86|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_73|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_73|, ULTIMATE.start_create_fresh_int_array_#t~post30#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post30#1_45|, #valid=|v_#valid_262|, #memory_int=|v_#memory_int_176|, #length=|v_#length_217|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_85|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_91|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post30#1, ULTIMATE.start_create_fresh_int_array_#t~nondet31#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1] 1598#[L107-14]don't care [2022-07-22 12:23:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1042779384, now seen corresponding path program 3 times [2022-07-22 12:23:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:02,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605944113] [2022-07-22 12:23:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:02,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:02,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1074, now seen corresponding path program 3 times [2022-07-22 12:23:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:02,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84724291] [2022-07-22 12:23:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:02,497 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:02,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:23:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2033576421, now seen corresponding path program 4 times [2022-07-22 12:23:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:23:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754019728] [2022-07-22 12:23:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:23:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:23:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:02,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:23:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:23:02,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:23:05,255 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:23:05,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:23:05,256 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:23:05,256 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:23:05,256 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:23:05,256 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:23:05,256 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:23:05,256 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:23:05,256 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-array-sum2.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 12:23:05,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:23:05,256 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:23:05,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:05,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:23:06,052 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:23:06,058 INFO L158 Benchmark]: Toolchain (without parser) took 19354.14ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 125.4MB in the beginning and 91.4MB in the end (delta: 34.1MB). Peak memory consumption was 131.6MB. Max. memory is 8.0GB. [2022-07-22 12:23:06,061 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 122.0MB in the end (delta: 429.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:23:06,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.28ms. Allocated memory is still 151.0MB. Free memory was 125.2MB in the beginning and 113.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:23:06,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.73ms. Allocated memory is still 151.0MB. Free memory was 113.6MB in the beginning and 111.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-07-22 12:23:06,067 INFO L158 Benchmark]: Boogie Preprocessor took 56.95ms. Allocated memory is still 151.0MB. Free memory was 111.1MB in the beginning and 109.2MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:23:06,068 INFO L158 Benchmark]: RCFGBuilder took 1060.02ms. Allocated memory is still 151.0MB. Free memory was 109.0MB in the beginning and 94.0MB in the end (delta: 15.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-07-22 12:23:06,068 INFO L158 Benchmark]: BuchiAutomizer took 17864.74ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 94.0MB in the beginning and 91.4MB in the end (delta: 2.6MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. [2022-07-22 12:23:06,073 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.27ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 122.0MB in the end (delta: 429.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.28ms. Allocated memory is still 151.0MB. Free memory was 125.2MB in the beginning and 113.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.73ms. Allocated memory is still 151.0MB. Free memory was 113.6MB in the beginning and 111.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.95ms. Allocated memory is still 151.0MB. Free memory was 111.1MB in the beginning and 109.2MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1060.02ms. Allocated memory is still 151.0MB. Free memory was 109.0MB in the beginning and 94.0MB in the end (delta: 15.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * BuchiAutomizer took 17864.74ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 94.0MB in the beginning and 91.4MB in the end (delta: 2.6MB). Peak memory consumption was 99.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 179 PlacesBefore, 31 PlacesAfterwards, 185 TransitionsBefore, 26 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 7 FixpointIterations, 123 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 23 TrivialYvCompositions, 6 ConcurrentYvCompositions, 11 ChoiceCompositions, 190 TotalNumberOfCompositions, 1431 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1350, positive: 1331, positive conditional: 0, positive unconditional: 1331, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 879, positive: 868, positive conditional: 0, positive unconditional: 868, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 879, positive: 868, positive conditional: 0, positive unconditional: 868, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 112, negative conditional: 0, negative unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1350, positive: 463, positive conditional: 0, positive unconditional: 463, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 879, unknown conditional: 0, unknown unconditional: 879] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:23:06,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-07-22 12:23:06,311 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...