/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/test-context1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:25:54,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:25:54,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:25:54,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:25:54,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:25:54,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:25:54,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:25:54,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:25:54,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:25:54,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:25:54,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:25:54,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:25:54,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:25:54,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:25:54,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:25:54,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:25:54,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:25:54,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:25:54,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:25:54,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:25:54,375 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:25:54,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:25:54,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:25:54,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:25:54,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:25:54,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:25:54,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:25:54,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:25:54,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:25:54,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:25:54,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:25:54,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:25:54,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:25:54,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:25:54,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:25:54,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:25:54,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:25:54,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:25:54,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:25:54,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:25:54,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:25:54,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:25:54,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:25:54,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:25:54,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:25:54,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:25:54,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:25:54,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:25:54,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:25:54,427 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:25:54,427 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:25:54,427 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:25:54,428 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:25:54,428 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:25:54,428 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:25:54,428 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:25:54,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:25:54,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:25:54,429 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:25:54,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:25:54,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:25:54,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:25:54,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:25:54,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:25:54,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:25:54,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:25:54,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:25:54,431 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:25:54,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:25:54,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:25:54,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:25:54,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:25:54,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:25:54,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:25:54,434 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:25:54,434 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:25:54,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:25:54,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:25:54,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:25:54,858 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:25:54,859 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:25:54,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-context1.wvr.c [2022-07-22 12:25:54,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea61d19b2/ba6c5682aef94d62a2b73bc4458e4080/FLAGd3f40cff6 [2022-07-22 12:25:55,654 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:25:55,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-context1.wvr.c [2022-07-22 12:25:55,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea61d19b2/ba6c5682aef94d62a2b73bc4458e4080/FLAGd3f40cff6 [2022-07-22 12:25:55,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea61d19b2/ba6c5682aef94d62a2b73bc4458e4080 [2022-07-22 12:25:55,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:25:55,988 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:25:55,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:55,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:25:55,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:25:55,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:55" (1/1) ... [2022-07-22 12:25:55,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68073535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:55, skipping insertion in model container [2022-07-22 12:25:55,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:25:55" (1/1) ... [2022-07-22 12:25:56,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:25:56,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:25:56,208 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/test-context1.wvr.c[2433,2446] [2022-07-22 12:25:56,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:56,225 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:25:56,249 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/test-context1.wvr.c[2433,2446] [2022-07-22 12:25:56,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:25:56,271 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:25:56,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56 WrapperNode [2022-07-22 12:25:56,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:25:56,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:56,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:25:56,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:25:56,282 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:25:56" (1/1) ... [2022-07-22 12:25:56,292 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:25:56" (1/1) ... [2022-07-22 12:25:56,326 INFO L137 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 129 [2022-07-22 12:25:56,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:25:56,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:25:56,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:25:56,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:25:56,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:25:56,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:25:56,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:25:56,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:25:56,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (1/1) ... [2022-07-22 12:25:56,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:25:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:25:56,422 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:25:56,429 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:25:56,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:25:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:25:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:25:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:25:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:25:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:25:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:25:56,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:25:56,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:25:56,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:25:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:25:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:25:56,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:25:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:25:56,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:25:56,496 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:25:56,631 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:25:56,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:25:57,033 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:25:57,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:25:57,254 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 12:25:57,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:57 BoogieIcfgContainer [2022-07-22 12:25:57,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:25:57,259 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:25:57,259 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:25:57,264 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:25:57,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:57,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:25:55" (1/3) ... [2022-07-22 12:25:57,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67ee0d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:57, skipping insertion in model container [2022-07-22 12:25:57,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:57,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:25:56" (2/3) ... [2022-07-22 12:25:57,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67ee0d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:25:57, skipping insertion in model container [2022-07-22 12:25:57,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:25:57,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:25:57" (3/3) ... [2022-07-22 12:25:57,270 INFO L322 chiAutomizerObserver]: Analyzing ICFG test-context1.wvr.c [2022-07-22 12:25:57,352 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:25:57,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 115 transitions, 246 flow [2022-07-22 12:25:57,444 INFO L129 PetriNetUnfolder]: 9/111 cut-off events. [2022-07-22 12:25:57,444 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:25:57,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 111 events. 9/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 12:25:57,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 115 transitions, 246 flow [2022-07-22 12:25:57,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 111 transitions, 234 flow [2022-07-22 12:25:57,478 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:25:57,499 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 111 transitions, 234 flow [2022-07-22 12:25:57,509 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 111 transitions, 234 flow [2022-07-22 12:25:57,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 111 transitions, 234 flow [2022-07-22 12:25:57,574 INFO L129 PetriNetUnfolder]: 9/111 cut-off events. [2022-07-22 12:25:57,574 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:25:57,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 111 events. 9/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-07-22 12:25:57,579 INFO L116 LiptonReduction]: Number of co-enabled transitions 368 [2022-07-22 12:26:01,489 INFO L131 LiptonReduction]: Checked pairs total: 445 [2022-07-22 12:26:01,489 INFO L133 LiptonReduction]: Total number of compositions: 117 [2022-07-22 12:26:01,542 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:26:01,542 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:26:01,542 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:26:01,542 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:26:01,543 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:26:01,543 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:26:01,543 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:26:01,543 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:26:01,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:26:01,577 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:26:01,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:01,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:01,584 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:26:01,585 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:01,585 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:26:01,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 20 states, but on-demand construction may add more states [2022-07-22 12:26:01,588 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2022-07-22 12:26:01,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:01,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:01,588 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:26:01,588 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:01,595 INFO L748 eck$LassoCheckResult]: Stem: 114#[ULTIMATE.startENTRY]don't care [506] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_163| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1)) (.cse2 (select |v_#memory_int_107| 1))) (and (= 2 (select |v_#length_126| 1)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| |v_#StackHeapBarrier_29|) (= (select |v_#valid_163| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= 0 v_~queue~0.offset_63) (= (select |v_#length_126| 2) 20) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_56| 0) (= (select |v_#valid_163| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|) 1 0) 0)) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (< |v_#StackHeapBarrier_29| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_47| 0) (= (select |v_#valid_163| 0) 0) (= |v_#valid_161| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| 1)) (= v_~n~0_76 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store (store (store |v_#length_126| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|)) |v_#length_124|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47|) 0) (= v_~x~0_53 5) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select .cse2 0) 48) (= v_~queue~0.base_63 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_60| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (< |v_#StackHeapBarrier_29| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (< 0 |v_#StackHeapBarrier_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= |v_#NULL.offset_10| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| 0)) (= v_~size~0_111 0) (= (select |v_#valid_163| 2) 1) (= (select .cse2 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)) (= v_~front~0_96 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_29|, #valid=|v_#valid_163|, #memory_int=|v_#memory_int_107|, #length=|v_#length_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_56|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_35|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_33|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_15|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_45|, #length=|v_#length_124|, ~front~0=v_~front~0_96, ~queue~0.offset=v_~queue~0.offset_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_22|, ~size~0=v_~size~0_111, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_30|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_63, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_60|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, #StackHeapBarrier=|v_#StackHeapBarrier_29|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_33|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_40|, #valid=|v_#valid_161|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, #memory_int=|v_#memory_int_107|, ~n~0=v_~n~0_76, ~x~0=v_~x~0_53, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~mem15#1, ~size~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 117#[L95-6]don't care [2022-07-22 12:26:01,595 INFO L750 eck$LassoCheckResult]: Loop: 117#[L95-6]don't care [478] L95-6-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_91| (store |v_#memory_int_92| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_92| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_17|))) (= (select |v_#valid_117| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4 .cse1) (select |v_#length_98| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_34|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35|, #valid=|v_#valid_117|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_17|, #memory_int=|v_#memory_int_92|, #length=|v_#length_98|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_34|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_15|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_91|, #length=|v_#length_98|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, #memory_int] 117#[L95-6]don't care [2022-07-22 12:26:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 537, now seen corresponding path program 1 times [2022-07-22 12:26:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:01,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414792104] [2022-07-22 12:26:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:01,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:01,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash 509, now seen corresponding path program 1 times [2022-07-22 12:26:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240301006] [2022-07-22 12:26:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:01,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:01,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:01,827 INFO L85 PathProgramCache]: Analyzing trace with hash 17125, now seen corresponding path program 1 times [2022-07-22 12:26:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:01,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058309645] [2022-07-22 12:26:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:01,918 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:01,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:02,483 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:02,484 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:02,484 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:02,484 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:02,484 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:02,484 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:02,485 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:02,485 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:02,485 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:26:02,485 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:02,485 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:02,511 INFO L141 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:26:02,518 INFO L141 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:26:02,520 INFO L141 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:26:02,521 INFO L141 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:26:02,523 INFO L141 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:26:02,525 INFO L141 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:26:02,528 INFO L141 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:26:02,530 INFO L141 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:26:02,532 INFO L141 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:26:02,534 INFO L141 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:26:02,536 INFO L141 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:26:02,538 INFO L141 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:26:02,540 INFO L141 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:26:02,542 INFO L141 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:26:02,544 INFO L141 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:26:02,548 INFO L141 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:26:02,900 INFO L141 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:26:02,903 INFO L141 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:26:02,905 INFO L141 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:26:02,907 INFO L141 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:26:02,909 INFO L141 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:26:02,911 INFO L141 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:26:02,913 INFO L141 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:26:02,915 INFO L141 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:26:02,918 INFO L141 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:26:02,920 INFO L141 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:26:02,922 INFO L141 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:26:02,925 INFO L141 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:26:02,927 INFO L141 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:26:02,929 INFO L141 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:26:03,358 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:26:03,364 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:26:03,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,370 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:26:03,381 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:26:03,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:03,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:03,402 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:26:03,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,450 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:26:03,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,452 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:26:03,456 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:26:03,457 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:26:03,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:03,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:03,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,509 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:26:03,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,511 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:26:03,513 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:26:03,514 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:26:03,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:03,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:03,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:03,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:03,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,565 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:26:03,566 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:26:03,567 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:26:03,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:03,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:03,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:03,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,609 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:26:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,611 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:26:03,612 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:26:03,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:03,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:03,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:03,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:03,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,649 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:26:03,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,651 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:26:03,652 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:26:03,653 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:26:03,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,667 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:03,667 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:03,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,696 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:26:03,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,697 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:26:03,698 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:26:03,699 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:26:03,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:03,709 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:03,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:03,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,750 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:26:03,750 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:26:03,751 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:26:03,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:03,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:03,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:03,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,786 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:26:03,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,807 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:03,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:26:03,817 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:26:03,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:03,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:03,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:03,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,878 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:03,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:26:03,880 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:26:03,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:03,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:03,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:03,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,933 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:03,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:26:03,935 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:26:03,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:03,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:03,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:03,946 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:03,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:03,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:03,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:03,973 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:03,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:26:03,975 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:26:03,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:03,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:03,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:03,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:03,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:03,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:03,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:03,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-22 12:26:04,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,016 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:26:04,018 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:26:04,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:04,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,065 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:26:04,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:26:04,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:04,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,107 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,147 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,154 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:26:04,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:04,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:26:04,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,213 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:26:04,215 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:26:04,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:04,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,267 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:26:04,271 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:26:04,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,280 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:26:04,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,289 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:26:04,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,349 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,352 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:26:04,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:04,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:26:04,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,410 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:26:04,413 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:26:04,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:04,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,468 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:26:04,473 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:26:04,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:26:04,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:26:04,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:26:04,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:26:04,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,510 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:26:04,512 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:26:04,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:26:04,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:26:04,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:26:04,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:26:04,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:26:04,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:26:04,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:26:04,607 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-22 12:26:04,607 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 12:26:04,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:26:04,630 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:26:04,672 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:26:04,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:26:04,697 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:26:04,697 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:26:04,698 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~0#1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~0#1 Supporting invariants [] [2022-07-22 12:26:04,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:04,813 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:26:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:04,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:26:04,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:04,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:26:04,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:26:04,908 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:26:04,942 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:26:04,945 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 20 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:26:04,988 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 20 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 22 states and 44 transitions. Complement of second has 3 states. [2022-07-22 12:26:04,990 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:26:04,996 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:26:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:26:04,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:26:05,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:05,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:26:05,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:05,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:26:05,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:26:05,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 44 transitions. [2022-07-22 12:26:05,004 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:26:05,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 16 states and 33 transitions. [2022-07-22 12:26:05,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-22 12:26:05,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 12:26:05,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 33 transitions. [2022-07-22 12:26:05,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:05,012 INFO L220 hiAutomatonCegarLoop]: Abstraction has 16 states and 33 transitions. [2022-07-22 12:26:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 33 transitions. [2022-07-22 12:26:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 12:26:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 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:26:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2022-07-22 12:26:05,044 INFO L242 hiAutomatonCegarLoop]: Abstraction has 16 states and 33 transitions. [2022-07-22 12:26:05,044 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 33 transitions. [2022-07-22 12:26:05,044 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:26:05,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 33 transitions. [2022-07-22 12:26:05,045 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:26:05,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:05,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:05,046 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:26:05,046 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:05,047 INFO L748 eck$LassoCheckResult]: Stem: 265#[ULTIMATE.startENTRY]don't care [506] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_163| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1)) (.cse2 (select |v_#memory_int_107| 1))) (and (= 2 (select |v_#length_126| 1)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| |v_#StackHeapBarrier_29|) (= (select |v_#valid_163| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= 0 v_~queue~0.offset_63) (= (select |v_#length_126| 2) 20) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_56| 0) (= (select |v_#valid_163| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|) 1 0) 0)) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (< |v_#StackHeapBarrier_29| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_47| 0) (= (select |v_#valid_163| 0) 0) (= |v_#valid_161| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| 1)) (= v_~n~0_76 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store (store (store |v_#length_126| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|)) |v_#length_124|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47|) 0) (= v_~x~0_53 5) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select .cse2 0) 48) (= v_~queue~0.base_63 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_60| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (< |v_#StackHeapBarrier_29| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (< 0 |v_#StackHeapBarrier_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= |v_#NULL.offset_10| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| 0)) (= v_~size~0_111 0) (= (select |v_#valid_163| 2) 1) (= (select .cse2 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)) (= v_~front~0_96 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_29|, #valid=|v_#valid_163|, #memory_int=|v_#memory_int_107|, #length=|v_#length_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_56|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_35|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_33|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_15|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_45|, #length=|v_#length_124|, ~front~0=v_~front~0_96, ~queue~0.offset=v_~queue~0.offset_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_22|, ~size~0=v_~size~0_111, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_30|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_63, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_60|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, #StackHeapBarrier=|v_#StackHeapBarrier_29|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_33|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_40|, #valid=|v_#valid_161|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, #memory_int=|v_#memory_int_107|, ~n~0=v_~n~0_76, ~x~0=v_~x~0_53, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~mem15#1, ~size~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 267#[L95-6]don't care [491] L95-6-->L79-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_57) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|) (= |v_ULTIMATE.start_main_#t~pre10#1_23| |v_#pthreadsForks_38|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_42| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= (select |v_#valid_133| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) 1) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_41| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre10#1_23|)) |v_#memory_int_95|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_104| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_57) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_42|, #valid=|v_#valid_133|, #memory_int=|v_#memory_int_96|, #length=|v_#length_104|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{~queue~0.offset=v_~queue~0.offset_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_42|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ~queue~0.base=v_~queue~0.base_57, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_23|, #valid=|v_#valid_133|, #memory_int=|v_#memory_int_95|, #length=|v_#length_104|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 273#[L79-3]don't care [387] L79-3-->L53: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_10|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 277#[L53, L79-4]don't care [2022-07-22 12:26:05,047 INFO L750 eck$LassoCheckResult]: Loop: 277#[L53, L79-4]don't care [438] L53-->L53: Formula: (let ((.cse2 (* v_~size~0_84 4)) (.cse3 (* v_~front~0_76 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_39))) (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (+ v_~size~0_84 1) v_~size~0_83) (not (= (ite (let ((.cse0 (+ v_~front~0_76 v_~size~0_84))) (and (< .cse0 v_~n~0_46) (<= 0 .cse0))) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_18| 256) 0)) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_61| v_~queue~0.base_39) .cse1) 5) 1 0)) (<= (+ .cse2 .cse3 4 v_~queue~0.offset_39) (select |v_#length_60| v_~queue~0.base_39)) (= (select |v_#valid_73| v_~queue~0.base_39) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_39, ~size~0=v_~size~0_84, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_61|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_18|, #length=|v_#length_60|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_46, ~front~0=v_~front~0_76} OutVars{~queue~0.offset=v_~queue~0.offset_39, ~size~0=v_~size~0_83, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_39, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_61|, #length=|v_#length_60|, ~n~0=v_~n~0_46, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, ~front~0=v_~front~0_76} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 277#[L53, L79-4]don't care [2022-07-22 12:26:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 531665, now seen corresponding path program 1 times [2022-07-22 12:26:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:05,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883063535] [2022-07-22 12:26:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash 469, now seen corresponding path program 1 times [2022-07-22 12:26:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:05,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539561832] [2022-07-22 12:26:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:05,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 16482053, now seen corresponding path program 1 times [2022-07-22 12:26:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:05,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699716520] [2022-07-22 12:26:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:26:05,231 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:26:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:26:05,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699716520] [2022-07-22 12:26:05,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699716520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:26:05,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:26:05,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:26:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111274709] [2022-07-22 12:26:05,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:26:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:26:05,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 12:26:05,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 12:26:05,327 INFO L87 Difference]: Start difference. First operand 16 states and 33 transitions. cyclomatic complexity: 28 Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:26:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:26:05,411 INFO L93 Difference]: Finished difference Result 29 states and 49 transitions. [2022-07-22 12:26:05,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 49 transitions. [2022-07-22 12:26:05,415 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:26:05,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 16 states and 32 transitions. [2022-07-22 12:26:05,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 12:26:05,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 12:26:05,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 32 transitions. [2022-07-22 12:26:05,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:26:05,419 INFO L220 hiAutomatonCegarLoop]: Abstraction has 16 states and 32 transitions. [2022-07-22 12:26:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 32 transitions. [2022-07-22 12:26:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 12:26:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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:26:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2022-07-22 12:26:05,425 INFO L242 hiAutomatonCegarLoop]: Abstraction has 16 states and 32 transitions. [2022-07-22 12:26:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 12:26:05,427 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 32 transitions. [2022-07-22 12:26:05,427 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:26:05,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 32 transitions. [2022-07-22 12:26:05,430 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2022-07-22 12:26:05,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:26:05,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:26:05,431 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:26:05,431 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:26:05,432 INFO L748 eck$LassoCheckResult]: Stem: 337#[ULTIMATE.startENTRY]don't care [506] ULTIMATE.startENTRY-->L95-6: Formula: (let ((.cse0 (store |v_#valid_163| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1)) (.cse2 (select |v_#memory_int_107| 1))) (and (= 2 (select |v_#length_126| 1)) (= |v_#NULL.base_10| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19| |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| |v_#StackHeapBarrier_29|) (= (select |v_#valid_163| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) 0) (= 0 v_~queue~0.offset_63) (= (select |v_#length_126| 2) 20) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_56| 0) (= (select |v_#valid_163| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|) 1 0) 0)) (= (select .cse0 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (< |v_#StackHeapBarrier_29| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_47| 0) (= (select |v_#valid_163| 0) 0) (= |v_#valid_161| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| 1)) (= v_~n~0_76 |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|) (= (store (store (store |v_#length_126| |v_ULTIMATE.start_main_~#t1~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_60|)) |v_#length_124|) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47|) 0) (= v_~x~0_53 5) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (= (select .cse2 0) 48) (= v_~queue~0.base_63 0) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_60| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (< |v_#StackHeapBarrier_29| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) (< 0 |v_#StackHeapBarrier_29|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (= |v_#NULL.offset_10| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47| 0)) (= v_~size~0_111 0) (= (select |v_#valid_163| 2) 1) (= (select .cse2 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_87| 0)) (= v_~front~0_96 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_29|, #valid=|v_#valid_163|, #memory_int=|v_#memory_int_107|, #length=|v_#length_126|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_47|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_56|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_35|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_18|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_19|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_87|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_33|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_27|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_15|, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset_45|, #length=|v_#length_124|, ~front~0=v_~front~0_96, ~queue~0.offset=v_~queue~0.offset_63, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_47|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_22|, ~size~0=v_~size~0_111, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_30|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_63, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_60|, #NULL.base=|v_#NULL.base_10|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, #StackHeapBarrier=|v_#StackHeapBarrier_29|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_19|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_33|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_40|, #valid=|v_#valid_161|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_29|, #memory_int=|v_#memory_int_107|, ~n~0=v_~n~0_76, ~x~0=v_~x~0_53, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_~#t2~0#1.offset, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, #length, ~front~0, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~mem15#1, ~size~0, ULTIMATE.start_main_#res#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_#t~nondet8#1, #valid, ULTIMATE.start_main_#t~pre10#1, ~n~0, ~x~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 339#[L95-6]don't care [478] L95-6-->L95-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| .cse1))) (and (<= 0 .cse0) (= |v_#memory_int_91| (store |v_#memory_int_92| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27| (store (select |v_#memory_int_92| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_17|))) (= (select |v_#valid_117| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27| 4 .cse1) (select |v_#length_98| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_34|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_35|, #valid=|v_#valid_117|, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet18#1_17|, #memory_int=|v_#memory_int_92|, #length=|v_#length_98|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_34|, ULTIMATE.start_create_fresh_int_array_#t~post17#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post17#1_15|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_91|, #length=|v_#length_98|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~post17#1, ULTIMATE.start_create_fresh_int_array_#t~nondet18#1, #memory_int] 345#[L95-6]don't care [491] L95-6-->L79-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| v_~queue~0.offset_57) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|) (= |v_ULTIMATE.start_main_#t~pre10#1_23| |v_#pthreadsForks_38|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_42| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= (select |v_#valid_133| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) 1) (= (store |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_41| (store (select |v_#memory_int_96| |v_ULTIMATE.start_main_~#t1~0#1.base_41|) |v_ULTIMATE.start_main_~#t1~0#1.offset_33| |v_ULTIMATE.start_main_#t~pre10#1_23|)) |v_#memory_int_95|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (select |v_#length_104| |v_ULTIMATE.start_main_~#t1~0#1.base_41|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20| v_~queue~0.base_57) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_33|) (= |v_#pthreadsForks_37| (+ |v_#pthreadsForks_38| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, #pthreadsForks=|v_#pthreadsForks_38|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_42|, #valid=|v_#valid_133|, #memory_int=|v_#memory_int_96|, #length=|v_#length_104|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|} OutVars{~queue~0.offset=v_~queue~0.offset_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_33|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_42|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_41|, ~queue~0.base=v_~queue~0.base_57, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_20|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_33|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_20|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_27|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_23|, #valid=|v_#valid_133|, #memory_int=|v_#memory_int_95|, #length=|v_#length_104|} AuxVars[] AssignedVars[~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret9#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~pre10#1, #memory_int, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base] 347#[L79-3]don't care [387] L79-3-->L53: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre10#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|} OutVars{thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_6|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_10|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] 349#[L53, L79-4]don't care [2022-07-22 12:26:05,433 INFO L750 eck$LassoCheckResult]: Loop: 349#[L53, L79-4]don't care [438] L53-->L53: Formula: (let ((.cse2 (* v_~size~0_84 4)) (.cse3 (* v_~front~0_76 4))) (let ((.cse1 (+ .cse2 .cse3 v_~queue~0.offset_39))) (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) (= (+ v_~size~0_84 1) v_~size~0_83) (not (= (ite (let ((.cse0 (+ v_~front~0_76 v_~size~0_84))) (and (< .cse0 v_~n~0_46) (<= 0 .cse0))) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_18| 256) 0)) (<= 0 .cse1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7| (ite (= (select (select |v_#memory_int_61| v_~queue~0.base_39) .cse1) 5) 1 0)) (<= (+ .cse2 .cse3 4 v_~queue~0.offset_39) (select |v_#length_60| v_~queue~0.base_39)) (= (select |v_#valid_73| v_~queue~0.base_39) 1)))) InVars {~queue~0.offset=v_~queue~0.offset_39, ~size~0=v_~size~0_84, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_61|, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_18|, #length=|v_#length_60|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_46, ~front~0=v_~front~0_76} OutVars{~queue~0.offset=v_~queue~0.offset_39, ~size~0=v_~size~0_83, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_7|, ~queue~0.base=v_~queue~0.base_39, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_61|, #length=|v_#length_60|, ~n~0=v_~n~0_46, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|, ~front~0=v_~front~0_76} AuxVars[] AssignedVars[~size~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 349#[L53, L79-4]don't care [2022-07-22 12:26:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash 16472733, now seen corresponding path program 1 times [2022-07-22 12:26:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:05,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89282839] [2022-07-22 12:26:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,511 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 469, now seen corresponding path program 2 times [2022-07-22 12:26:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:05,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702221783] [2022-07-22 12:26:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:05,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:26:05,556 INFO L85 PathProgramCache]: Analyzing trace with hash 510655161, now seen corresponding path program 1 times [2022-07-22 12:26:05,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:26:05,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563722628] [2022-07-22 12:26:05,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:26:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:26:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:26:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:26:05,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:26:06,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:26:06,724 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:26:06,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:26:06,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:26:06,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:26:06,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:26:06,725 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:26:06,725 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:26:06,725 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:26:06,726 INFO L133 ssoRankerPreferences]: Filename of dumped script: test-context1.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:26:06,726 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:26:06,726 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:26:06,731 INFO L141 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:26:06,734 INFO L141 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:26:06,739 INFO L141 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:26:06,742 INFO L141 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:26:06,744 INFO L141 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:26:06,749 INFO L141 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:26:06,752 INFO L141 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:26:06,754 INFO L141 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:26:06,756 INFO L141 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:26:06,758 INFO L141 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:26:06,761 INFO L141 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:26:06,763 INFO L141 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:26:06,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:26:06,770 INFO L141 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:26:06,972 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:26:06,976 INFO L158 Benchmark]: Toolchain (without parser) took 10991.49ms. Allocated memory was 160.4MB in the beginning and 219.2MB in the end (delta: 58.7MB). Free memory was 134.5MB in the beginning and 144.7MB in the end (delta: -10.2MB). Peak memory consumption was 122.2MB. Max. memory is 8.0GB. [2022-07-22 12:26:06,976 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 160.4MB. Free memory was 130.4MB in the beginning and 130.3MB in the end (delta: 68.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:26:06,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.15ms. Allocated memory is still 160.4MB. Free memory was 134.2MB in the beginning and 123.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:26:06,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.49ms. Allocated memory is still 160.4MB. Free memory was 123.6MB in the beginning and 121.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:26:06,978 INFO L158 Benchmark]: Boogie Preprocessor took 36.57ms. Allocated memory is still 160.4MB. Free memory was 121.6MB in the beginning and 120.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:26:06,979 INFO L158 Benchmark]: RCFGBuilder took 892.30ms. Allocated memory is still 160.4MB. Free memory was 120.1MB in the beginning and 135.9MB in the end (delta: -15.8MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2022-07-22 12:26:06,980 INFO L158 Benchmark]: BuchiAutomizer took 9716.02ms. Allocated memory was 160.4MB in the beginning and 219.2MB in the end (delta: 58.7MB). Free memory was 135.4MB in the beginning and 144.7MB in the end (delta: -9.3MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. [2022-07-22 12:26:06,983 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.32ms. Allocated memory is still 160.4MB. Free memory was 130.4MB in the beginning and 130.3MB in the end (delta: 68.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.15ms. Allocated memory is still 160.4MB. Free memory was 134.2MB in the beginning and 123.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.49ms. Allocated memory is still 160.4MB. Free memory was 123.6MB in the beginning and 121.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.57ms. Allocated memory is still 160.4MB. Free memory was 121.6MB in the beginning and 120.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 892.30ms. Allocated memory is still 160.4MB. Free memory was 120.1MB in the beginning and 135.9MB in the end (delta: -15.8MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 9716.02ms. Allocated memory was 160.4MB in the beginning and 219.2MB in the end (delta: 58.7MB). Free memory was 135.4MB in the beginning and 144.7MB in the end (delta: -9.3MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 109 PlacesBefore, 19 PlacesAfterwards, 111 TransitionsBefore, 15 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 7 FixpointIterations, 75 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 6 ConcurrentYvCompositions, 6 ChoiceCompositions, 117 TotalNumberOfCompositions, 445 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 438, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 302, positive: 298, positive conditional: 0, positive unconditional: 298, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 302, positive: 298, positive conditional: 0, positive unconditional: 298, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 438, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 302, unknown conditional: 0, unknown unconditional: 302] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:26:07,038 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...