/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:50:05,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:50:05,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:50:05,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:50:05,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:50:05,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:50:05,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:50:05,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:50:05,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:50:05,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:50:05,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:50:05,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:50:05,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:50:05,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:50:05,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:50:05,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:50:05,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:50:05,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:50:05,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:50:05,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:50:05,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:50:05,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:50:05,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:50:05,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:50:05,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:50:05,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:50:05,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:50:05,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:50:05,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:50:05,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:50:05,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:50:05,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:50:05,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:50:05,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:50:05,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:50:05,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:50:05,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:50:05,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:50:05,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:50:05,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:50:05,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:50:05,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:50:05,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:50:05,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:50:05,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:50:05,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:50:05,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:50:05,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:50:05,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:50:05,419 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:50:05,419 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:50:05,419 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:50:05,420 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:50:05,421 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:50:05,421 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:50:05,421 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:50:05,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:50:05,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:50:05,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:50:05,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:50:05,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:50:05,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:50:05,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:50:05,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:50:05,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:50:05,423 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:50:05,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:50:05,423 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:50:05,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:50:05,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:50:05,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:50:05,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:50:05,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:50:05,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:50:05,426 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:50:05,428 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:50:05,429 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:50:05,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:50:05,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:50:05,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:50:05,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:50:05,836 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:50:05,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-07-22 12:50:05,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1e3288/7b10d4dba759450eabcc7694fee6dcec/FLAG63745d2f3 [2022-07-22 12:50:06,535 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:50:06,535 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-07-22 12:50:06,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1e3288/7b10d4dba759450eabcc7694fee6dcec/FLAG63745d2f3 [2022-07-22 12:50:06,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf1e3288/7b10d4dba759450eabcc7694fee6dcec [2022-07-22 12:50:06,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:50:06,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:50:06,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:50:06,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:50:06,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:50:06,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:50:06" (1/1) ... [2022-07-22 12:50:06,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75da784e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:06, skipping insertion in model container [2022-07-22 12:50:06,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:50:06" (1/1) ... [2022-07-22 12:50:06,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:50:06,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:50:07,097 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-sum-array-hom.wvr.c[2396,2409] [2022-07-22 12:50:07,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:50:07,114 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:50:07,140 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-sum-array-hom.wvr.c[2396,2409] [2022-07-22 12:50:07,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:50:07,164 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:50:07,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07 WrapperNode [2022-07-22 12:50:07,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:50:07,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:50:07,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:50:07,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:50:07,176 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:50:07" (1/1) ... [2022-07-22 12:50:07,199 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:50:07" (1/1) ... [2022-07-22 12:50:07,250 INFO L137 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 99 [2022-07-22 12:50:07,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:50:07,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:50:07,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:50:07,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:50:07,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:50:07,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:50:07,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:50:07,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:50:07,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (1/1) ... [2022-07-22 12:50:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:07,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:07,385 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:50:07,408 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:50:07,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:50:07,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:50:07,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:50:07,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:50:07,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:50:07,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:50:07,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:50:07,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:50:07,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:50:07,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:50:07,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:50:07,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:50:07,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:50:07,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:50:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:50:07,478 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:50:07,635 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:50:07,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:50:08,026 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:50:08,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:50:08,055 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:50:08,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:50:08 BoogieIcfgContainer [2022-07-22 12:50:08,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:50:08,062 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:50:08,062 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:50:08,067 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:50:08,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:08,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:50:06" (1/3) ... [2022-07-22 12:50:08,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7958283b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:50:08, skipping insertion in model container [2022-07-22 12:50:08,070 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:08,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:07" (2/3) ... [2022-07-22 12:50:08,071 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7958283b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:50:08, skipping insertion in model container [2022-07-22 12:50:08,071 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:08,071 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:50:08" (3/3) ... [2022-07-22 12:50:08,073 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-07-22 12:50:08,260 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:50:08,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 159 transitions, 342 flow [2022-07-22 12:50:08,397 INFO L129 PetriNetUnfolder]: 12/153 cut-off events. [2022-07-22 12:50:08,397 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:50:08,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-07-22 12:50:08,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 159 transitions, 342 flow [2022-07-22 12:50:08,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 153 transitions, 324 flow [2022-07-22 12:50:08,428 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:50:08,439 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 153 transitions, 324 flow [2022-07-22 12:50:08,442 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 153 transitions, 324 flow [2022-07-22 12:50:08,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 324 flow [2022-07-22 12:50:08,478 INFO L129 PetriNetUnfolder]: 12/153 cut-off events. [2022-07-22 12:50:08,478 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:50:08,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-07-22 12:50:08,483 INFO L116 LiptonReduction]: Number of co-enabled transitions 1728 [2022-07-22 12:50:13,557 INFO L131 LiptonReduction]: Checked pairs total: 1856 [2022-07-22 12:50:13,558 INFO L133 LiptonReduction]: Total number of compositions: 146 [2022-07-22 12:50:13,582 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:50:13,583 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:50:13,583 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:50:13,583 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:50:13,583 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:50:13,583 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:50:13,583 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:50:13,584 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:50:13,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:50:13,658 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:50:13,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:13,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:13,666 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:50:13,666 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:13,666 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:50:13,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 106 states, but on-demand construction may add more states [2022-07-22 12:50:13,680 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:50:13,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:13,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:13,681 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:50:13,681 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:13,688 INFO L748 eck$LassoCheckResult]: Stem: 157#[ULTIMATE.startENTRY]don't care [554] ULTIMATE.startENTRY-->L100-6: Formula: (let ((.cse0 (store |v_#valid_174| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse3 (select |v_#memory_int_101| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_47| 1))) (and (= (select |v_#valid_174| 0) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|) 1 0) 0)) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_47|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= v_~A~0.base_50 0) (= 2 (select |v_#length_129| 1)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_174| 2) 1) (= (store (store (store (store |v_#length_129| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_47| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4)) |v_#length_127|) (= 32 (select |v_#length_129| 2)) (= (select |v_#valid_174| 1) 1) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~A~0.offset_50 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_47|) 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46| 0) (= (select .cse3 1) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21| v_~N~0_57) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|) (= (select |v_#valid_174| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~sum1~0_41 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= v_~sum3~0_41 0) (= v_~sum2~0_41 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| |v_#StackHeapBarrier_32|) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_39| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select .cse3 0) 48) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 1) |v_#valid_172|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_101|, #length=|v_#length_129|} OutVars{~A~0.base=v_~A~0.base_50, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_47|, ~sum3~0=v_~sum3~0_41, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_47|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_22|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_24|, #length=|v_#length_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~sum2~0=v_~sum2~0_41, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_27|, ~N~0=v_~N~0_57, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_24|, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_21|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_47|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, ~sum1~0=v_~sum1~0_41, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_34|, #valid=|v_#valid_172|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_34|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_35|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ~sum3~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ~sum2~0, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~pre14#1, ~sum1~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 160#[L100-6]don't care [2022-07-22 12:50:13,688 INFO L750 eck$LassoCheckResult]: Loop: 160#[L100-6]don't care [531] L100-6-->L100-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse0 4) (select |v_#length_81| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|)) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|) (= (select |v_#valid_116| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) 1) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23| (store (select |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|))) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_62|, #length=|v_#length_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_61|, #length=|v_#length_81|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_21|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 160#[L100-6]don't care [2022-07-22 12:50:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:13,695 INFO L85 PathProgramCache]: Analyzing trace with hash 585, now seen corresponding path program 1 times [2022-07-22 12:50:13,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:13,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173314704] [2022-07-22 12:50:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:13,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:13,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash 562, now seen corresponding path program 1 times [2022-07-22 12:50:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:13,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549330360] [2022-07-22 12:50:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:13,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:13,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:13,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 18666, now seen corresponding path program 1 times [2022-07-22 12:50:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:13,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895561631] [2022-07-22 12:50:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:13,993 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:14,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:14,705 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:14,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:14,706 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:14,706 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:14,706 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:14,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:14,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:14,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sum-array-hom.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:50:14,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:14,708 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:14,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:14,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:14,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:15,697 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:15,702 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:15,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,709 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:50:15,717 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:50:15,724 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:50:15,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,778 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:50:15,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,781 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:50:15,790 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:50:15,793 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:50:15,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,845 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:50:15,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,847 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:50:15,857 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:50:15,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,873 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,878 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:50:15,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-22 12:50:15,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,919 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:50:15,924 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:50:15,930 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:50:15,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,983 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:50:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,986 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:50:15,989 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:50:15,989 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:50:15,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:16,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,050 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:50:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,052 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:50:16,058 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:50:16,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,073 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:50:16,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,128 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:50:16,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,130 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:50:16,133 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:50:16,133 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:50:16,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,168 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:16,219 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-22 12:50:16,219 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 12:50:16,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,229 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:50:16,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:16,281 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:50:16,294 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:50:16,294 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:16,295 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~size#1) = -1*ULTIMATE.start_create_fresh_uint_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_uint_array_~size#1 Supporting invariants [] [2022-07-22 12:50:16,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-22 12:50:16,479 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:50:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:16,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:16,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:16,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:50:16,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:16,571 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:50:16,616 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:50:16,620 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 106 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:50:16,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 106 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 108 states and 329 transitions. Complement of second has 3 states. [2022-07-22 12:50:16,701 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:50:16,707 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:50:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:50:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:50:16,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:50:16,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:16,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:50:16,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:16,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 329 transitions. [2022-07-22 12:50:16,719 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 62 [2022-07-22 12:50:16,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 100 states and 310 transitions. [2022-07-22 12:50:16,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-22 12:50:16,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2022-07-22 12:50:16,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 310 transitions. [2022-07-22 12:50:16,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:16,735 INFO L220 hiAutomatonCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:50:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 310 transitions. [2022-07-22 12:50:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-22 12:50:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 3.1) internal successors, (310), 99 states have internal predecessors, (310), 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:50:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 310 transitions. [2022-07-22 12:50:16,792 INFO L242 hiAutomatonCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:50:16,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:50:16,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:50:16,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 310 transitions. [2022-07-22 12:50:16,796 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 62 [2022-07-22 12:50:16,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:16,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:16,796 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:50:16,796 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:16,797 INFO L748 eck$LassoCheckResult]: Stem: 780#[ULTIMATE.startENTRY]don't care [554] ULTIMATE.startENTRY-->L100-6: Formula: (let ((.cse0 (store |v_#valid_174| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse3 (select |v_#memory_int_101| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_47| 1))) (and (= (select |v_#valid_174| 0) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|) 1 0) 0)) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_47|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= v_~A~0.base_50 0) (= 2 (select |v_#length_129| 1)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_174| 2) 1) (= (store (store (store (store |v_#length_129| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_47| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4)) |v_#length_127|) (= 32 (select |v_#length_129| 2)) (= (select |v_#valid_174| 1) 1) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~A~0.offset_50 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_47|) 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46| 0) (= (select .cse3 1) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21| v_~N~0_57) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|) (= (select |v_#valid_174| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~sum1~0_41 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= v_~sum3~0_41 0) (= v_~sum2~0_41 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| |v_#StackHeapBarrier_32|) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_39| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select .cse3 0) 48) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 1) |v_#valid_172|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_101|, #length=|v_#length_129|} OutVars{~A~0.base=v_~A~0.base_50, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_47|, ~sum3~0=v_~sum3~0_41, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_47|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_22|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_24|, #length=|v_#length_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~sum2~0=v_~sum2~0_41, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_27|, ~N~0=v_~N~0_57, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_24|, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_21|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_47|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, ~sum1~0=v_~sum1~0_41, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_34|, #valid=|v_#valid_172|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_34|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_35|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ~sum3~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ~sum2~0, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~pre14#1, ~sum1~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 762#[L100-6]don't care [551] L100-6-->L82-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= (select |v_#valid_160| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= v_~A~0.base_46 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|) (= |v_ULTIMATE.start_main_#t~pre10#1_31| |v_#pthreadsForks_59|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|) (= (ite (and (<= v_~M~0_45 v_~N~0_51) (<= 0 v_~M~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= |v_#memory_int_95| (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre10#1_31|))) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_119| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= v_~A~0.offset_46 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ~M~0=v_~M~0_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_96|, #length=|v_#length_119|, ~N~0=v_~N~0_51, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|} OutVars{~A~0.base=v_~A~0.base_46, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|, ~N~0=v_~N~0_51, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~A~0.offset=v_~A~0.offset_46, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_58|, ~M~0=v_~M~0_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_31|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_95|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 662#[L82-3]don't care [399] L82-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 664#[thread1ENTRY, L82-4]don't care [361] thread1ENTRY-->L48-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 650#[L48-5, L82-4]don't care [2022-07-22 12:50:16,798 INFO L750 eck$LassoCheckResult]: Loop: 650#[L48-5, L82-4]don't care [543] L48-5-->L48-5: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork0_~i~0_36 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_38))) (and (= (+ v_thread1Thread1of1ForFork0_~i~0_36 1) v_thread1Thread1of1ForFork0_~i~0_35) (< v_thread1Thread1of1ForFork0_~i~0_36 v_~N~0_43) (= (+ v_~sum1~0_32 (select (select |v_#memory_int_87| v_~A~0.base_38) .cse0)) v_~sum1~0_31) (<= (+ .cse1 v_~A~0.offset_38 4) (select |v_#length_101| v_~A~0.base_38)) (= (select |v_#valid_140| v_~A~0.base_38) 1) (<= 0 .cse0)))) InVars {~A~0.base=v_~A~0.base_38, ~A~0.offset=v_~A~0.offset_38, ~sum1~0=v_~sum1~0_32, #valid=|v_#valid_140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_36, #memory_int=|v_#memory_int_87|, #length=|v_#length_101|, ~N~0=v_~N~0_43} OutVars{~A~0.base=v_~A~0.base_38, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_17|, ~A~0.offset=v_~A~0.offset_38, ~sum1~0=v_~sum1~0_31, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, #valid=|v_#valid_140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, #memory_int=|v_#memory_int_87|, #length=|v_#length_101|, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, ~sum1~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] 650#[L48-5, L82-4]don't care [2022-07-22 12:50:16,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:16,799 INFO L85 PathProgramCache]: Analyzing trace with hash 17969976, now seen corresponding path program 1 times [2022-07-22 12:50:16,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:16,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137828433] [2022-07-22 12:50:16,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:16,837 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:16,931 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:50:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:16,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:16,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash 574, now seen corresponding path program 1 times [2022-07-22 12:50:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:16,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110321032] [2022-07-22 12:50:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:16,972 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:16,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:16,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash 557069799, now seen corresponding path program 1 times [2022-07-22 12:50:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:16,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943561270] [2022-07-22 12:50:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:17,080 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:50:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:17,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943561270] [2022-07-22 12:50:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943561270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:50:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:50:17,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:50:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543706956] [2022-07-22 12:50:17,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:50:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:50:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:50:17,126 INFO L87 Difference]: Start difference. First operand 100 states and 310 transitions. cyclomatic complexity: 273 Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:17,295 INFO L93 Difference]: Finished difference Result 197 states and 589 transitions. [2022-07-22 12:50:17,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 589 transitions. [2022-07-22 12:50:17,309 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 110 [2022-07-22 12:50:17,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 193 states and 577 transitions. [2022-07-22 12:50:17,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2022-07-22 12:50:17,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2022-07-22 12:50:17,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 577 transitions. [2022-07-22 12:50:17,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:17,328 INFO L220 hiAutomatonCegarLoop]: Abstraction has 193 states and 577 transitions. [2022-07-22 12:50:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 577 transitions. [2022-07-22 12:50:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 149. [2022-07-22 12:50:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 3.134228187919463) internal successors, (467), 148 states have internal predecessors, (467), 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:50:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 467 transitions. [2022-07-22 12:50:17,365 INFO L242 hiAutomatonCegarLoop]: Abstraction has 149 states and 467 transitions. [2022-07-22 12:50:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:50:17,371 INFO L425 stractBuchiCegarLoop]: Abstraction has 149 states and 467 transitions. [2022-07-22 12:50:17,371 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:50:17,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 467 transitions. [2022-07-22 12:50:17,378 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 86 [2022-07-22 12:50:17,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:17,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:17,379 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:50:17,379 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:17,380 INFO L748 eck$LassoCheckResult]: Stem: 1239#[ULTIMATE.startENTRY]don't care [554] ULTIMATE.startENTRY-->L100-6: Formula: (let ((.cse0 (store |v_#valid_174| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_49| 1))) (let ((.cse3 (select |v_#memory_int_101| 1)) (.cse1 (store .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_47| 1))) (and (= (select |v_#valid_174| 0) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_49|) 0) (= |v_#NULL.base_12| 0) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|) 1 0) 0)) (= (select .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|) 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_43| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_47|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) (= v_~A~0.base_50 0) (= 2 (select |v_#length_129| 1)) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35| 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select |v_#valid_174| 2) 1) (= (store (store (store (store |v_#length_129| |v_ULTIMATE.start_main_~#t1~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_49| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_47| 4) |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| (* |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| 4)) |v_#length_127|) (= 32 (select |v_#length_129| 2)) (= (select |v_#valid_174| 1) 1) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_49|) (= v_~A~0.offset_50 0) (= (select .cse2 |v_ULTIMATE.start_main_~#t3~0#1.base_47|) 0) (not (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 0)) (= |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46| 0) (= (select .cse3 1) 0) (= |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21| v_~N~0_57) (= |v_ULTIMATE.start_create_fresh_uint_array_~size#1_44| |v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|) (= (select |v_#valid_174| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) 0) (= v_~sum1~0_41 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= v_~sum3~0_41 0) (= v_~sum2~0_41 0) (< |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| |v_#StackHeapBarrier_32|) (= |v_#NULL.offset_12| 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_39| 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_101| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= (select .cse3 0) 48) (= (store .cse1 |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35| 1) |v_#valid_172|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_174|, #memory_int=|v_#memory_int_101|, #length=|v_#length_129|} OutVars{~A~0.base=v_~A~0.base_50, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_44|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_39|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_26|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_47|, ~sum3~0=v_~sum3~0_41, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_uint_array_#in~size#1=|v_ULTIMATE.start_create_fresh_uint_array_#in~size#1_21|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_33|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_101|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_47|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_22|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_21|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_24|, #length=|v_#length_127|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_35|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_46|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_35|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset_27|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_24|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_22|, ~sum2~0=v_~sum2~0_41, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_27|, ~N~0=v_~N~0_57, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, #NULL.base=|v_#NULL.base_12|, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_24|, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_21|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_47|, ~A~0.offset=v_~A~0.offset_50, ~M~0=v_~M~0_51, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_29|, ~sum1~0=v_~sum1~0_41, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_34|, #valid=|v_#valid_172|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_34|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_35|, #memory_int=|v_#memory_int_101|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_49|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_19|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_uint_array_~size#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t3~0#1.base, ~sum3~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_uint_array_#in~size#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.base, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, #length, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_uint_array_~i~3#1, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_uint_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ~sum2~0, ULTIMATE.start_create_fresh_uint_array_#t~post20#1, ~N~0, ULTIMATE.start_main_~#t1~0#1.base, #NULL.base, ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~pre14#1, ~sum1~0, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1197#[L100-6]don't care [531] L100-6-->L100-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23| .cse0 4) (select |v_#length_81| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|)) (= (+ |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| 1) |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|) (= (select |v_#valid_116| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) 1) (= |v_#memory_int_61| (store |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23| (store (select |v_#memory_int_62| |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|) .cse1 |v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|))) (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1_17|, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_33|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_62|, #length=|v_#length_81|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} OutVars{ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_32|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_34|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_23|, #valid=|v_#valid_116|, #memory_int=|v_#memory_int_61|, #length=|v_#length_81|, ULTIMATE.start_create_fresh_uint_array_#t~post20#1=|v_ULTIMATE.start_create_fresh_uint_array_#t~post20#1_21|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_23|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_uint_array_#t~nondet21#1, ULTIMATE.start_create_fresh_uint_array_~i~3#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#t~post20#1] 1199#[L100-6]don't care [551] L100-6-->L82-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (not (< |v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44| |v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= (select |v_#valid_160| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) 1) (= v_~A~0.base_46 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|) (= |v_ULTIMATE.start_main_#t~pre10#1_31| |v_#pthreadsForks_59|) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|) (= (ite (and (<= v_~M~0_45 v_~N~0_51) (<= 0 v_~M~0_45)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|) (= |v_#memory_int_95| (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_37| |v_ULTIMATE.start_main_#t~pre10#1_31|))) (= |v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33| |v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_37|) (select |v_#length_119| |v_ULTIMATE.start_main_~#t1~0#1.base_43|)) (= v_~A~0.offset_46 |v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ~M~0=v_~M~0_45, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_96|, #length=|v_#length_119|, ~N~0=v_~N~0_51, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|} OutVars{~A~0.base=v_~A~0.base_46, ULTIMATE.start_create_fresh_uint_array_~i~3#1=|v_ULTIMATE.start_create_fresh_uint_array_~i~3#1_44|, ULTIMATE.start_create_fresh_uint_array_~size#1=|v_ULTIMATE.start_create_fresh_uint_array_~size#1_42|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_uint_array_#res#1.base=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.base_22|, ~N~0=v_~N~0_51, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_37|, ~A~0.offset=v_~A~0.offset_46, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_58|, ~M~0=v_~M~0_45, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_41|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_31|, #valid=|v_#valid_160|, #memory_int=|v_#memory_int_95|, ULTIMATE.start_create_fresh_uint_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_#res#1.offset_22|, #length=|v_#length_119|, ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_77|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_uint_array_#res#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ULTIMATE.start_create_fresh_uint_array_#res#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 1201#[L82-3]don't care [399] L82-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_8|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 1289#[thread1ENTRY, L82-4]don't care [361] thread1ENTRY-->L48-5: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 1287#[L48-5, L82-4]don't care [2022-07-22 12:50:17,381 INFO L750 eck$LassoCheckResult]: Loop: 1287#[L48-5, L82-4]don't care [543] L48-5-->L48-5: Formula: (let ((.cse1 (* v_thread1Thread1of1ForFork0_~i~0_36 4))) (let ((.cse0 (+ .cse1 v_~A~0.offset_38))) (and (= (+ v_thread1Thread1of1ForFork0_~i~0_36 1) v_thread1Thread1of1ForFork0_~i~0_35) (< v_thread1Thread1of1ForFork0_~i~0_36 v_~N~0_43) (= (+ v_~sum1~0_32 (select (select |v_#memory_int_87| v_~A~0.base_38) .cse0)) v_~sum1~0_31) (<= (+ .cse1 v_~A~0.offset_38 4) (select |v_#length_101| v_~A~0.base_38)) (= (select |v_#valid_140| v_~A~0.base_38) 1) (<= 0 .cse0)))) InVars {~A~0.base=v_~A~0.base_38, ~A~0.offset=v_~A~0.offset_38, ~sum1~0=v_~sum1~0_32, #valid=|v_#valid_140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_36, #memory_int=|v_#memory_int_87|, #length=|v_#length_101|, ~N~0=v_~N~0_43} OutVars{~A~0.base=v_~A~0.base_38, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_17|, ~A~0.offset=v_~A~0.offset_38, ~sum1~0=v_~sum1~0_31, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, #valid=|v_#valid_140|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, #memory_int=|v_#memory_int_87|, #length=|v_#length_101|, ~N~0=v_~N~0_43} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, ~sum1~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] 1287#[L48-5, L82-4]don't care [2022-07-22 12:50:17,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 556621047, now seen corresponding path program 1 times [2022-07-22 12:50:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:17,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446891071] [2022-07-22 12:50:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:17,514 INFO L85 PathProgramCache]: Analyzing trace with hash 574, now seen corresponding path program 2 times [2022-07-22 12:50:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:17,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099447018] [2022-07-22 12:50:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash 75383816, now seen corresponding path program 1 times [2022-07-22 12:50:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:17,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646309171] [2022-07-22 12:50:17,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:17,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:18,937 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:18,938 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:18,938 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:18,938 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:18,938 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:18,938 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:18,938 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:18,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:18,939 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sum-array-hom.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:50:18,939 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:18,939 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:19,258 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:50:19,261 INFO L158 Benchmark]: Toolchain (without parser) took 12398.35ms. Allocated memory was 158.3MB in the beginning and 250.6MB in the end (delta: 92.3MB). Free memory was 131.9MB in the beginning and 196.2MB in the end (delta: -64.3MB). Peak memory consumption was 117.7MB. Max. memory is 8.0GB. [2022-07-22 12:50:19,262 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 158.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:50:19,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.96ms. Allocated memory is still 158.3MB. Free memory was 131.7MB in the beginning and 120.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:50:19,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.20ms. Allocated memory is still 158.3MB. Free memory was 120.2MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:50:19,264 INFO L158 Benchmark]: Boogie Preprocessor took 66.96ms. Allocated memory is still 158.3MB. Free memory was 118.5MB in the beginning and 117.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:50:19,265 INFO L158 Benchmark]: RCFGBuilder took 741.11ms. Allocated memory is still 158.3MB. Free memory was 116.8MB in the beginning and 136.9MB in the end (delta: -20.1MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2022-07-22 12:50:19,266 INFO L158 Benchmark]: BuchiAutomizer took 11197.77ms. Allocated memory was 158.3MB in the beginning and 250.6MB in the end (delta: 92.3MB). Free memory was 136.9MB in the beginning and 196.2MB in the end (delta: -59.3MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. [2022-07-22 12:50:19,269 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.29ms. Allocated memory is still 158.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.96ms. Allocated memory is still 158.3MB. Free memory was 131.7MB in the beginning and 120.4MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.20ms. Allocated memory is still 158.3MB. Free memory was 120.2MB in the beginning and 118.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.96ms. Allocated memory is still 158.3MB. Free memory was 118.5MB in the beginning and 117.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 741.11ms. Allocated memory is still 158.3MB. Free memory was 116.8MB in the beginning and 136.9MB in the end (delta: -20.1MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 11197.77ms. Allocated memory was 158.3MB in the beginning and 250.6MB in the end (delta: 92.3MB). Free memory was 136.9MB in the beginning and 196.2MB in the end (delta: -59.3MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 151 PlacesBefore, 30 PlacesAfterwards, 153 TransitionsBefore, 24 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 7 FixpointIterations, 87 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 146 TotalNumberOfCompositions, 1856 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1733, positive: 1714, positive conditional: 0, positive unconditional: 1714, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 935, positive: 926, positive conditional: 0, positive unconditional: 926, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1733, positive: 788, positive conditional: 0, positive unconditional: 788, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 935, unknown conditional: 0, unknown unconditional: 935] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, 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:50:19,321 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...